Base | Representation |
---|---|
bin | 11110100101101111100… |
… | …001010001011101101001 |
3 | 21102221220122211100110000 |
4 | 132211233201101131221 |
5 | 233420110130013001 |
6 | 4245410200413213 |
7 | 304605150123003 |
oct | 36455741213551 |
9 | 7387818740400 |
10 | 2102110001001 |
11 | 74055532596a |
12 | 29b4a0477209 |
13 | 1232c7253aca |
14 | 73a57c41373 |
15 | 39a325a7a86 |
hex | 1e96f851769 |
2102110001001 has 20 divisors (see below), whose sum is σ = 3140228006212. Its totient is φ = 1401389265888.
The previous prime is 2102110000957. The next prime is 2102110001053. The reversal of 2102110001001 is 1001000112012.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1477537491600 + 624572509401 = 1215540^2 + 790299^2 .
It is not a de Polignac number, because 2102110001001 - 226 = 2102042892137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102110001401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12722151 + ... + 12886323.
Almost surely, 22102110001001 is an apocalyptic number.
It is an amenable number.
2102110001001 is a deficient number, since it is larger than the sum of its proper divisors (1038118005211).
2102110001001 is a wasteful number, since it uses less digits than its factorization.
2102110001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322262 (or 322253 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2102110001001 its reverse (1001000112012), we get a palindrome (3103110113013).
The spelling of 2102110001001 in words is "two trillion, one hundred two billion, one hundred ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •