Base | Representation |
---|---|
bin | 10010110100010000… |
… | …00111010010000010 |
3 | 222002000201022220221 |
4 | 21122020013102002 |
5 | 131142103323020 |
6 | 4350225053254 |
7 | 505223451100 |
oct | 113210072202 |
9 | 28060638827 |
10 | 10102011010 |
11 | 431435a433 |
12 | 1b5b18722a |
13 | c4cb86410 |
14 | 6bb918c70 |
15 | 3e1d0d6aa |
hex | 25a207482 |
10102011010 has 288 divisors, whose sum is σ = 25218127872. Its totient is φ = 2881992960.
The previous prime is 10102011001. The next prime is 10102011037. The reversal of 10102011010 is 1011020101.
It is a super-2 number, since 2×101020110102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 10102010984 and 10102011002.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 52890015 + ... + 52890205.
It is an arithmetic number, because the mean of its divisors is an integer number (87562944).
Almost surely, 210102011010 is an apocalyptic number.
10102011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10102011010 is an abundant number, since it is smaller than the sum of its proper divisors (15116116862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102011010 is a wasteful number, since it uses less digits than its factorization.
10102011010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286 (or 260 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10102011010 its reverse (1011020101), we get a palindrome (11113031111).
Subtracting from 10102011010 its reverse (1011020101), we obtain a palindrome (9090990909).
The spelling of 10102011010 in words is "ten billion, one hundred two million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •