Base | Representation |
---|---|
bin | 10010101000001101… |
… | …11001101111011110 |
3 | 221210222200222011121 |
4 | 21110012321233132 |
5 | 130440230430420 |
6 | 4332220441154 |
7 | 502556232121 |
oct | 112406715736 |
9 | 27728628147 |
10 | 10001030110 |
11 | 4272358a45 |
12 | 1b313a91ba |
13 | c34c8b2c6 |
14 | 6ac3503b8 |
15 | 3d80132aa |
hex | 2541b9bde |
10001030110 has 32 divisors (see below), whose sum is σ = 18134075232. Its totient is φ = 3971111040.
The previous prime is 10001030101. The next prime is 10001030173. The reversal of 10001030110 is 1103010001.
It is a happy number.
It is a super-2 number, since 2×100010301102 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10001030093 and 10001030102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1057764 + ... + 1067176.
It is an arithmetic number, because the mean of its divisors is an integer number (566689851).
Almost surely, 210001030110 is an apocalyptic number.
10001030110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10001030110 is a deficient number, since it is larger than the sum of its proper divisors (8133045122).
10001030110 is a wasteful number, since it uses less digits than its factorization.
10001030110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10188.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 10001030110 its reverse (1103010001), we get a palindrome (11104040111).
The spelling of 10001030110 in words is "ten billion, one million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •