Base | Representation |
---|---|
bin | 10010101001011010… |
… | …10110101011110011 |
3 | 221211200200002100201 |
4 | 21110231112223303 |
5 | 131000321011011 |
6 | 4333220500031 |
7 | 503041014001 |
oct | 112455265363 |
9 | 27750602321 |
10 | 10011110131 |
11 | 4278013240 |
12 | 1b3484a617 |
13 | c370aa409 |
14 | 6ad815a71 |
15 | 3d8d54cc1 |
hex | 254b56af3 |
10011110131 has 8 divisors (see below), whose sum is σ = 10922112000. Its totient is φ = 9100258440.
The previous prime is 10011110117. The next prime is 10011110149. The reversal of 10011110131 is 13101111001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10011110131 - 27 = 10011110003 is a prime.
It is a super-2 number, since 2×100111101312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011110101) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 137250 + ... + 197128.
It is an arithmetic number, because the mean of its divisors is an integer number (1365264000).
Almost surely, 210011110131 is an apocalyptic number.
10011110131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10011110131 is a deficient number, since it is larger than the sum of its proper divisors (911001869).
10011110131 is a wasteful number, since it uses less digits than its factorization.
10011110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75089.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 10011110131 its reverse (13101111001), we get a palindrome (23112221132).
The spelling of 10011110131 in words is "ten billion, eleven million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •