Base | Representation |
---|---|
bin | 11011010010010000110000… |
… | …101100110101100010010110 |
3 | 120201220002122212200210101001 |
4 | 123102100300230311202112 |
5 | 111212104003021411410 |
6 | 1103120130125253514 |
7 | 34163605316051143 |
oct | 3322206054654226 |
9 | 521802585623331 |
10 | 120002203310230 |
11 | 3526671535485a |
12 | 1156129310429a |
13 | 51c620ba49c37 |
14 | 218c1cd92d3ca |
15 | dd17eccc833a |
hex | 6d2430b35896 |
120002203310230 has 8 divisors (see below), whose sum is σ = 216003965958432. Its totient is φ = 48000881324088.
The previous prime is 120002203310207. The next prime is 120002203310233. The reversal of 120002203310230 is 32013302200021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 120002203310198 and 120002203310207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120002203310233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6000110165502 + ... + 6000110165521.
It is an arithmetic number, because the mean of its divisors is an integer number (27000495744804).
Almost surely, 2120002203310230 is an apocalyptic number.
120002203310230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120002203310230 is a deficient number, since it is larger than the sum of its proper divisors (96001762648202).
120002203310230 is a wasteful number, since it uses less digits than its factorization.
120002203310230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12000220331030.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 120002203310230 its reverse (32013302200021), we get a palindrome (152015505510251).
The spelling of 120002203310230 in words is "one hundred twenty trillion, two billion, two hundred three million, three hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •