Base | Representation |
---|---|
bin | 1001001100011110101011… |
… | …1101010110111111110010 |
3 | 1022210111200021122021120212 |
4 | 2103013222331112333302 |
5 | 2311120240000013020 |
6 | 33300245254504122 |
7 | 2062265140050560 |
oct | 223075275267762 |
9 | 38714607567525 |
10 | 10110000001010 |
11 | 3248699484968 |
12 | 1173476665042 |
13 | 5844a4655a10 |
14 | 26d480312a30 |
15 | 127eb703acc5 |
hex | 931eaf56ff2 |
10110000001010 has 64 divisors (see below), whose sum is σ = 23169867436800. Its totient is φ = 3089315642112.
The previous prime is 10110000000977. The next prime is 10110000001033. The reversal of 10110000001010 is 1010000001101.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 10110000000985 and 10110000001003.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 191523440 + ... + 191576219.
It is an arithmetic number, because the mean of its divisors is an integer number (362029178700).
Almost surely, 210110000001010 is an apocalyptic number.
10110000001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110000001010 is an abundant number, since it is smaller than the sum of its proper divisors (13059867435790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110000001010 is a wasteful number, since it uses less digits than its factorization.
10110000001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383099715.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10110000001010 its reverse (1010000001101), we get a palindrome (11120000002111).
Subtracting from 10110000001010 its reverse (1010000001101), we obtain a palindrome (9099999999909).
The spelling of 10110000001010 in words is "ten trillion, one hundred ten billion, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •