Base | Representation |
---|---|
bin | 11011010010011000001000… |
… | …000010010010011001100100 |
3 | 120201220212001222102011110212 |
4 | 123102120020002102121210 |
5 | 111212221201404032322 |
6 | 1103123514530434552 |
7 | 34164305266243544 |
oct | 3322301002223144 |
9 | 521825058364425 |
10 | 120010111002212 |
11 | 3526a003004892 |
12 | 1156291b432a58 |
13 | 51c6b9c110712 |
14 | 218c73dc49324 |
15 | dd1b1213d0e2 |
hex | 6d2608092664 |
120010111002212 has 12 divisors (see below), whose sum is σ = 212377443628140. Its totient is φ = 59330841394176.
The previous prime is 120010111002211. The next prime is 120010111002217. The reversal of 120010111002212 is 212200111010021.
It can be written as a sum of positive squares in 2 ways, for example, as 8968970790976 + 111041140211236 = 2994824^2 + 10537606^2 .
It is not an unprimeable number, because it can be changed into a prime (120010111002211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168553526333 + ... + 168553527044.
It is an arithmetic number, because the mean of its divisors is an integer number (17698120302345).
Almost surely, 2120010111002212 is an apocalyptic number.
It is an amenable number.
120010111002212 is a deficient number, since it is larger than the sum of its proper divisors (92367332625928).
120010111002212 is a wasteful number, since it uses less digits than its factorization.
120010111002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337107053470 (or 337107053468 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 120010111002212 its reverse (212200111010021), we get a palindrome (332210222012233).
The spelling of 120010111002212 in words is "one hundred twenty trillion, ten billion, one hundred eleven million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •