Base | Representation |
---|---|
bin | 1001000110110010010110… |
… | …1000000010111111111010 |
3 | 1022110011020102201120210102 |
4 | 2101230211220002333322 |
5 | 2303014441201201020 |
6 | 33143312521515402 |
7 | 2052233435666504 |
oct | 221544550027772 |
9 | 38404212646712 |
10 | 10012200022010 |
11 | 321017199313a |
12 | 1158521642b62 |
13 | 5781b9884364 |
14 | 268843536d74 |
15 | 125691024475 |
hex | 91b25a02ffa |
10012200022010 has 8 divisors (see below), whose sum is σ = 18021960039636. Its totient is φ = 4004880008800.
The previous prime is 10012200021983. The next prime is 10012200022021. The reversal of 10012200022010 is 1022000221001.
It is a happy number.
10012200022010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9588194583361 + 424005438649 = 3096481^2 + 651157^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10012200021982 and 10012200022000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500610001091 + ... + 500610001110.
Almost surely, 210012200022010 is an apocalyptic number.
10012200022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10012200022010 is a deficient number, since it is larger than the sum of its proper divisors (8009760017626).
10012200022010 is a wasteful number, since it uses less digits than its factorization.
10012200022010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001220002208.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10012200022010 its reverse (1022000221001), we get a palindrome (11034200243011).
The spelling of 10012200022010 in words is "ten trillion, twelve billion, two hundred million, twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •