Base | Representation |
---|---|
bin | 11011010010001110111011… |
… | …000101101011011110011010 |
3 | 120201212220120100202220001220 |
4 | 123102032323011223132122 |
5 | 111212040432402024010 |
6 | 1103115202240552510 |
7 | 34163505366122115 |
oct | 3322167305533632 |
9 | 521786510686056 |
10 | 120000230111130 |
11 | 352658a25530a6 |
12 | 11560a22322736 |
13 | 51c5c85cc76c5 |
14 | 218c08384d57c |
15 | dd173495b970 |
hex | 6d23bb16b79a |
120000230111130 has 32 divisors (see below), whose sum is σ = 288000866853504. Its totient is φ = 32000026408896.
The previous prime is 120000230111101. The next prime is 120000230111147. The reversal of 120000230111130 is 31111032000021.
It is a happy number.
It is a super-2 number, since 2×1200002301111302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37637787 + ... + 40701393.
It is an arithmetic number, because the mean of its divisors is an integer number (9000027089172).
Almost surely, 2120000230111130 is an apocalyptic number.
120000230111130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120000230111130 is an abundant number, since it is smaller than the sum of its proper divisors (168000636742374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120000230111130 is a wasteful number, since it uses less digits than its factorization.
120000230111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4369270.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 120000230111130 its reverse (31111032000021), we get a palindrome (151111262111151).
The spelling of 120000230111130 in words is "one hundred twenty trillion, two hundred thirty million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •