Base | Representation |
---|---|
bin | 11011010010011000000010… |
… | …100111111111100101100011 |
3 | 120201220211211122121010021002 |
4 | 123102120002213333211203 |
5 | 111212221010134121311 |
6 | 1103123501525022215 |
7 | 34164303114525230 |
oct | 3322300247774543 |
9 | 521824748533232 |
10 | 120010020223331 |
11 | 35269a66841317 |
12 | 115628b4b5496b |
13 | 51c6b863780c4 |
14 | 218c731b78787 |
15 | dd1b091aa93b |
hex | 6d26029ff963 |
120010020223331 has 8 divisors (see below), whose sum is σ = 137383280966400. Its totient is φ = 102694002515208.
The previous prime is 120010020223319. The next prime is 120010020223349. The reversal of 120010020223331 is 133322020010021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120010020223331 is a prime.
It is a super-2 number, since 2×1200100202233312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120010020223031) 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, 14310754241 + ... + 14310762626.
It is an arithmetic number, because the mean of its divisors is an integer number (17172910120800).
Almost surely, 2120010020223331 is an apocalyptic number.
120010020223331 is a deficient number, since it is larger than the sum of its proper divisors (17373260743069).
120010020223331 is an equidigital number, since it uses as much as digits as its factorization.
120010020223331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28621517473.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 120010020223331 its reverse (133322020010021), we get a palindrome (253332040233352).
The spelling of 120010020223331 in words is "one hundred twenty trillion, ten billion, twenty million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •