Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0011010010001011111110 |
3 | 1022102221211202222222110021 |
4 | 2101222221003102023332 |
5 | 2303001201130310420 |
6 | 33142325301402354 |
7 | 2052130600122400 |
oct | 221525103221376 |
9 | 38387752888407 |
10 | 10010110010110 |
11 | 320a29a157281 |
12 | 11580397093ba |
13 | 577c45882822 |
14 | 2686c5b2ab70 |
15 | 1255bc7d17aa |
hex | 91aa90d22fe |
10010110010110 has 48 divisors (see below), whose sum is σ = 20965179577824. Its totient is φ = 3431180534208.
The previous prime is 10010110010083. The next prime is 10010110010143. The reversal of 10010110010110 is 1101001101001.
It is a happy number.
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 = 10010110010093 and 10010110010102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 585709 + ... + 4512568.
It is an arithmetic number, because the mean of its divisors is an integer number (436774574538).
Almost surely, 210010110010110 is an apocalyptic number.
10010110010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010110010110 is an abundant number, since it is smaller than the sum of its proper divisors (10955069567714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010110010110 is a wasteful number, since it uses less digits than its factorization.
10010110010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5102305 (or 5102298 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10010110010110 its reverse (1101001101001), we get a palindrome (11111111111111).
The spelling of 10010110010110 in words is "ten trillion, ten billion, one hundred ten million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •