Base | Representation |
---|---|
bin | 11101001010010111110… |
… | …11010001101011110101 |
3 | 10112210100012001102122200 |
4 | 32211023323101223311 |
5 | 112404044302210401 |
6 | 2044151335215113 |
7 | 132251344520553 |
oct | 16451373215365 |
9 | 3483305042580 |
10 | 1002001210101 |
11 | 356a45619741 |
12 | 142240217499 |
13 | 73646a77928 |
14 | 366d6138bd3 |
15 | 1b0e72b7686 |
hex | e94bed1af5 |
1002001210101 has 24 divisors (see below), whose sum is σ = 1565078246784. Its totient is φ = 615329900160.
The previous prime is 1002001210099. The next prime is 1002001210103. The reversal of 1002001210101 is 1010121002001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1002001210099) and next prime (1002001210103).
It is not a de Polignac number, because 1002001210101 - 21 = 1002001210099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002001210103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69663315 + ... + 69677696.
It is an arithmetic number, because the mean of its divisors is an integer number (65211593616).
Almost surely, 21002001210101 is an apocalyptic number.
It is an amenable number.
1002001210101 is a deficient number, since it is larger than the sum of its proper divisors (563077036683).
1002001210101 is a wasteful number, since it uses less digits than its factorization.
1002001210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139341081 (or 139341078 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1002001210101 its reverse (1010121002001), we get a palindrome (2012122212102).
The spelling of 1002001210101 in words is "one trillion, two billion, one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •