Base | Representation |
---|---|
bin | 10010110101001101… |
… | …00101101110001100 |
3 | 222002120202012202220 |
4 | 21122212211232030 |
5 | 131201130000022 |
6 | 4351112215340 |
7 | 505351403460 |
oct | 113246455614 |
9 | 28076665686 |
10 | 10110000012 |
11 | 4318916712 |
12 | 1b6199a550 |
13 | c51722838 |
14 | 6bc9d84a0 |
15 | 3e288a85c |
hex | 25a9a5b8c |
10110000012 has 48 divisors (see below), whose sum is σ = 27087820032. Its totient is φ = 2874876480.
The previous prime is 10109999987. The next prime is 10110000059. The reversal of 10110000012 is 21000001101.
10110000012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 267483 + ... + 302930.
It is an arithmetic number, because the mean of its divisors is an integer number (564329584).
Almost surely, 210110000012 is an apocalyptic number.
10110000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110000012 is an abundant number, since it is smaller than the sum of its proper divisors (16977820020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110000012 is a wasteful number, since it uses less digits than its factorization.
10110000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570638 (or 570636 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 10110000012 its reverse (21000001101), we get a palindrome (31110001113).
The spelling of 10110000012 in words is "ten billion, one hundred ten million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •