Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111001010100001010 |
3 | 100200020111122211202100 |
4 | 1132100211321110022 |
5 | 3124234241213002 |
6 | 114254551414230 |
7 | 10212036443523 |
oct | 1362045712412 |
9 | 320214584670 |
10 | 101210101002 |
11 | 39a1751097a |
12 | 17747084376 |
13 | 970c42c73a |
14 | 4c81a5d84a |
15 | 29755bd11c |
hex | 179097950a |
101210101002 has 96 divisors (see below), whose sum is σ = 230159180160. Its totient is φ = 32082019200.
The previous prime is 101210100989. The next prime is 101210101063. The reversal of 101210101002 is 200101012101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 80388649 + ... + 80389907.
It is an arithmetic number, because the mean of its divisors is an integer number (2397491460).
Almost surely, 2101210101002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101210101002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115079590080).
101210101002 is an abundant number, since it is smaller than the sum of its proper divisors (128949079158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210101002 is a wasteful number, since it uses less digits than its factorization.
101210101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2268 (or 2265 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101210101002 its reverse (200101012101), we get a palindrome (301311113103).
The spelling of 101210101002 in words is "one hundred one billion, two hundred ten million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •