Base | Representation |
---|---|
bin | 10010110101100110… |
… | …01110010100001011 |
3 | 222002210222110222112 |
4 | 21122303032110023 |
5 | 131203001441021 |
6 | 4351311212535 |
7 | 505421506445 |
oct | 113263162413 |
9 | 28083873875 |
10 | 10113312011 |
11 | 431a779000 |
12 | 1b62b1714b |
13 | c523121ba |
14 | 6bd21b495 |
15 | 3e2ce1d5b |
hex | 25acce50b |
10113312011 has 16 divisors (see below), whose sum is σ = 11226098400. Its totient is φ = 9109441440.
The previous prime is 10113311993. The next prime is 10113312031. The reversal of 10113312011 is 11021331101.
It is a happy number.
10113312011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10113312011 - 230 = 9039570187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10113312031) by changing a digit.
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, 110225 + ... + 179933.
It is an arithmetic number, because the mean of its divisors is an integer number (701631150).
Almost surely, 210113312011 is an apocalyptic number.
10113312011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10113312011 is a deficient number, since it is larger than the sum of its proper divisors (1112786389).
10113312011 is an equidigital number, since it uses as much as digits as its factorization.
10113312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69851 (or 69829 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10113312011 its reverse (11021331101), we get a palindrome (21134643112).
The spelling of 10113312011 in words is "ten billion, one hundred thirteen million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •