Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101110001110000000110 |
3 | 21002101202210112222201100 |
4 | 131020212131301300012 |
5 | 230300300111200402 |
6 | 4131430241240530 |
7 | 264434623026624 |
oct | 35104635616006 |
9 | 7071683488640 |
10 | 2002100100102 |
11 | 7020a4348103 |
12 | 28402b333146 |
13 | 116a4968895b |
14 | 6cc8b764514 |
15 | 3712c56471c |
hex | 1d226771c06 |
2002100100102 has 12 divisors (see below), whose sum is σ = 4337883550260. Its totient is φ = 667366700028.
The previous prime is 2002100100041. The next prime is 2002100100163. The reversal of 2002100100102 is 2010010012002.
It is an interprime number because it is at equal distance from previous prime (2002100100041) and next prime (2002100100163).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55613891652 + ... + 55613891687.
It is an arithmetic number, because the mean of its divisors is an integer number (361490295855).
Almost surely, 22002100100102 is an apocalyptic number.
2002100100102 is an abundant number, since it is smaller than the sum of its proper divisors (2335783450158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002100100102 is a wasteful number, since it uses less digits than its factorization.
2002100100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111227783347 (or 111227783344 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2002100100102 its reverse (2010010012002), we get a palindrome (4012110112104).
The spelling of 2002100100102 in words is "two trillion, two billion, one hundred million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •