Base | Representation |
---|---|
bin | 11101101101110000111… |
… | …10011000001010110100 |
3 | 10121121101101210202101220 |
4 | 32312320132120022310 |
5 | 113212003032021322 |
6 | 2101013020550340 |
7 | 133523246451522 |
oct | 16667036301264 |
9 | 3547341722356 |
10 | 1021002220212 |
11 | 364006154887 |
12 | 145a636b23b0 |
13 | 753844aa090 |
14 | 375b9897312 |
15 | 1b85a4a155c |
hex | edb87982b4 |
1021002220212 has 48 divisors (see below), whose sum is σ = 2573792235840. Its totient is φ = 313150825728.
The previous prime is 1021002220211. The next prime is 1021002220253. The reversal of 1021002220212 is 2120222001201.
It is a junction number, because it is equal to n+sod(n) for n = 1021002220191 and 1021002220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021002220211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10406262 + ... + 10503917.
It is an arithmetic number, because the mean of its divisors is an integer number (53620671580).
Almost surely, 21021002220212 is an apocalyptic number.
1021002220212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1021002220212 is an abundant number, since it is smaller than the sum of its proper divisors (1552790015628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021002220212 is a wasteful number, since it uses less digits than its factorization.
1021002220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20910512 (or 20910510 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1021002220212 its reverse (2120222001201), we get a palindrome (3141224221413).
The spelling of 1021002220212 in words is "one trillion, twenty-one billion, two million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •