Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …011101101111011111110100 |
3 | 111101221010222100201120111120 |
4 | 113033133321131233133310 |
5 | 101344233242133013022 |
6 | 1001223134323503540 |
7 | 30350105444605635 |
oct | 2717377135573764 |
9 | 441833870646446 |
10 | 102220112001012 |
11 | 2a6303403961a5 |
12 | b56ab38827bb0 |
13 | 450641365a1a5 |
14 | 1b356a08a188c |
15 | bc3ea6712d5c |
hex | 5cf7f976f7f4 |
102220112001012 has 48 divisors (see below), whose sum is σ = 239091654197760. Its totient is φ = 33990796734048.
The previous prime is 102220112000911. The next prime is 102220112001037. The reversal of 102220112001012 is 210100211022201.
It is a junction number, because it is equal to n+sod(n) for n = 102220112000982 and 102220112001000.
It is a congruent 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, 141343443 + ... + 142064805.
It is an arithmetic number, because the mean of its divisors is an integer number (4981076129120).
Almost surely, 2102220112001012 is an apocalyptic number.
102220112001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102220112001012 is an abundant number, since it is smaller than the sum of its proper divisors (136871542196748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102220112001012 is a wasteful number, since it uses less digits than its factorization.
102220112001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 749972 (or 749970 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102220112001012 its reverse (210100211022201), we get a palindrome (312320323023213).
The spelling of 102220112001012 in words is "one hundred two trillion, two hundred twenty billion, one hundred twelve million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •