Base | Representation |
---|---|
bin | 10010101010101111… |
… | …01010101010011100 |
3 | 221212110112121120010 |
4 | 21111113222222130 |
5 | 131011140431022 |
6 | 4334254323220 |
7 | 503234211564 |
oct | 112527525234 |
9 | 27773477503 |
10 | 10022202012 |
11 | 42832a9789 |
12 | 1b384b9510 |
13 | c39491c64 |
14 | 6b10a1da4 |
15 | 3d9ce650c |
hex | 2555eaa9c |
10022202012 has 12 divisors (see below), whose sum is σ = 23385138056. Its totient is φ = 3340734000.
The previous prime is 10022201993. The next prime is 10022202013. The reversal of 10022202012 is 21020222001.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 835183501 = 10022202012 / (1 + 0 + 0 + 2 + 2 + 2 + 0 + 2 + 0 + 1 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022202013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417591739 + ... + 417591762.
Almost surely, 210022202012 is an apocalyptic number.
10022202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10022202012 is an abundant number, since it is smaller than the sum of its proper divisors (13362936044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10022202012 is a wasteful number, since it uses less digits than its factorization.
10022202012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835183508 (or 835183506 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10022202012 its reverse (21020222001), we get a palindrome (31042424013).
The spelling of 10022202012 in words is "ten billion, twenty-two million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •