Base | Representation |
---|---|
bin | 11011010010001110110100… |
… | …000011001000000010110010 |
3 | 120201212220021010112021201010 |
4 | 123102032310003020002302 |
5 | 111212040212133014302 |
6 | 1103115142421251350 |
7 | 34163502433162236 |
oct | 3322166403100262 |
9 | 521786233467633 |
10 | 120000112001202 |
11 | 35265841912394 |
12 | 115609aa863b56 |
13 | 51c5c676b2b84 |
14 | 218c071ca65c6 |
15 | dd17293cb16c |
hex | 6d23b40c80b2 |
120000112001202 has 64 divisors (see below), whose sum is σ = 245382068404224. Its totient is φ = 39104984817600.
The previous prime is 120000112001183. The next prime is 120000112001207. The reversal of 120000112001202 is 202100211000021.
120000112001202 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (120000112001207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3645519648 + ... + 3645552564.
It is an arithmetic number, because the mean of its divisors is an integer number (3834094818816).
Almost surely, 2120000112001202 is an apocalyptic number.
120000112001202 is an abundant number, since it is smaller than the sum of its proper divisors (125381956403022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120000112001202 is a wasteful number, since it uses less digits than its factorization.
120000112001202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47103.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 120000112001202 its reverse (202100211000021), we get a palindrome (322100323001223).
The spelling of 120000112001202 in words is "one hundred twenty trillion, one hundred twelve million, one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •