Base | Representation |
---|---|
bin | 110111111110110111… |
… | …0110011101111111111 |
3 | 102111022102001202101001 |
4 | 1233331232303233333 |
5 | 3432203040220411 |
6 | 131121225431131 |
7 | 11454121560001 |
oct | 1577556635777 |
9 | 374272052331 |
10 | 120221023231 |
11 | 46a926a7151 |
12 | 1b37193b4a7 |
13 | b44bc2274a |
14 | 5b6683c371 |
15 | 31d95b3dc1 |
hex | 1bfdbb3bff |
120221023231 has 8 divisors (see below), whose sum is σ = 121042096128. Its totient is φ = 119401947000.
The previous prime is 120221023201. The next prime is 120221023333. The reversal of 120221023231 is 132320122021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120221023231 - 223 = 120212634623 is a prime.
It is a super-2 number, since 2×1202210232312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120221023199 and 120221023208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120221023201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 378235 + ... + 619276.
It is an arithmetic number, because the mean of its divisors is an integer number (15130262016).
Almost surely, 2120221023231 is an apocalyptic number.
120221023231 is a deficient number, since it is larger than the sum of its proper divisors (821072897).
120221023231 is an equidigital number, since it uses as much as digits as its factorization.
120221023231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 998333.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 120221023231 its reverse (132320122021), we get a palindrome (252541145252).
The spelling of 120221023231 in words is "one hundred twenty billion, two hundred twenty-one million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •