Base | Representation |
---|---|
bin | 11011010010001111110101… |
… | …000001100110010110110000 |
3 | 120201220000002002210001201120 |
4 | 123102033311001212112300 |
5 | 111212044430220320422 |
6 | 1103115442522302240 |
7 | 34163541441062415 |
oct | 3322176501462660 |
9 | 521800062701646 |
10 | 120001202120112 |
11 | 35266251198905 |
12 | 11561053957980 |
13 | 51c60ac4b4151 |
14 | 218c13699210c |
15 | dd178ee5e45c |
hex | 6d23f50665b0 |
120001202120112 has 40 divisors (see below), whose sum is σ = 318381567791856. Its totient is φ = 38919308795136.
The previous prime is 120001202120081. The next prime is 120001202120147. The reversal of 120001202120112 is 211021202100021.
It is a junction number, because it is equal to n+sod(n) for n = 120001202120091 and 120001202120100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33784120443 + ... + 33784123994.
Almost surely, 2120001202120112 is an apocalyptic number.
120001202120112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120001202120112 is an abundant number, since it is smaller than the sum of its proper divisors (198380365671744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120001202120112 is a wasteful number, since it uses less digits than its factorization.
120001202120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67568244485 (or 67568244479 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120001202120112 its reverse (211021202100021), we get a palindrome (331022404220133).
The spelling of 120001202120112 in words is "one hundred twenty trillion, one billion, two hundred two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •