Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111101000000001001101000 |
3 | 111101120120212010121002201022 |
4 | 113032002300331000021220 |
5 | 101341113441432223422 |
6 | 1001105155331512012 |
7 | 30336635361120341 |
oct | 2716026075001150 |
9 | 441516763532638 |
10 | 102120111211112 |
11 | 2a5a1994570695 |
12 | b55368a758608 |
13 | 44c9b67932067 |
14 | 1b308d56b70c8 |
15 | bc15a23be342 |
hex | 5ce0b0f40268 |
102120111211112 has 8 divisors (see below), whose sum is σ = 191475208520850. Its totient is φ = 51060055605552.
The previous prime is 102120111211087. The next prime is 102120111211123. The reversal of 102120111211112 is 211112111021201.
It can be written as a sum of positive squares in only one way, i.e., 97543395476836 + 4576715734276 = 9876406^2 + 2139326^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1021201112111122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 6382506950687 + ... + 6382506950702.
Almost surely, 2102120111211112 is an apocalyptic number.
It is an amenable number.
102120111211112 is a deficient number, since it is larger than the sum of its proper divisors (89355097309738).
102120111211112 is a wasteful number, since it uses less digits than its factorization.
102120111211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12765013901395 (or 12765013901391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 102120111211112 its reverse (211112111021201), we get a palindrome (313232222232313).
The spelling of 102120111211112 in words is "one hundred two trillion, one hundred twenty billion, one hundred eleven million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •