Base | Representation |
---|---|
bin | 11101001000100000110… |
… | …00000000110010010110 |
3 | 10112200202120001220010000 |
4 | 32210100120000302112 |
5 | 112400023020010402 |
6 | 2043504245112130 |
7 | 132214523355561 |
oct | 16442030006226 |
9 | 3480676056100 |
10 | 1001002110102 |
11 | 356582660065 |
12 | 1420016b8646 |
13 | 73517a942b7 |
14 | 3663d5834d8 |
15 | 1b089712c1c |
hex | e910600c96 |
1001002110102 has 80 divisors (see below), whose sum is σ = 2341056544992. Its totient is φ = 319085205120.
The previous prime is 1001002110091. The next prime is 1001002110113. The reversal of 1001002110102 is 2010112001001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1001002110091) and next prime (1001002110113).
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 polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 17099202 + ... + 17157642.
Almost surely, 21001002110102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001002110102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1170528272496).
1001002110102 is an abundant number, since it is smaller than the sum of its proper divisors (1340054434890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001002110102 is a wasteful number, since it uses less digits than its factorization.
1001002110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63075 (or 63066 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1001002110102 its reverse (2010112001001), we get a palindrome (3011114111103).
The spelling of 1001002110102 in words is "one trillion, one billion, two million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •