Base | Representation |
---|---|
bin | 11101001010011001001… |
… | …00011110011001111110 |
3 | 10112210100221101010111000 |
4 | 32211030210132121332 |
5 | 112404110033310420 |
6 | 2044152402511130 |
7 | 132251535361506 |
oct | 16451444363176 |
9 | 3483327333430 |
10 | 1002012010110 |
11 | 356a50725971 |
12 | 1422439654a6 |
13 | 73649089677 |
14 | 366d774aa06 |
15 | 1b0e81ec690 |
hex | e94c91e67e |
1002012010110 has 96 divisors (see below), whose sum is σ = 2793258830880. Its totient is φ = 255585635712.
The previous prime is 1002012010093. The next prime is 1002012010121. The reversal of 1002012010110 is 110102102001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1002012010092 and 1002012010101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3364879 + ... + 3650538.
It is an arithmetic number, because the mean of its divisors is an integer number (29096446155).
Almost surely, 21002012010110 is an apocalyptic number.
1002012010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1002012010110 is an abundant number, since it is smaller than the sum of its proper divisors (1791246820770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002012010110 is a wasteful number, since it uses less digits than its factorization.
1002012010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7015479 (or 7015450 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1002012010110 its reverse (110102102001), we get a palindrome (1112114112111).
The spelling of 1002012010110 in words is "one trillion, two billion, twelve million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •