Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101101111010000010011 |
3 | 1022102002100122211000021101 |
4 | 2101202022231233100103 |
5 | 2302324032321022211 |
6 | 33134222344405231 |
7 | 2051356243552501 |
oct | 221421255572023 |
9 | 38362318730241 |
10 | 10001011110931 |
11 | 3206450056695 |
12 | 115631a476817 |
13 | 577125785b09 |
14 | 2680a152d671 |
15 | 125238abb5c1 |
hex | 9188ab6f413 |
10001011110931 has 2 divisors, whose sum is σ = 10001011110932. Its totient is φ = 10001011110930.
The previous prime is 10001011110899. The next prime is 10001011110967. The reversal of 10001011110931 is 13901111010001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001011110931 - 25 = 10001011110899 is a prime.
It is a super-2 number, since 2×100010111109312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10001011110899 and 10001011110908.
It is not a weakly prime, because it can be changed into another prime (10001011150931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000505555465 + 5000505555466.
It is an arithmetic number, because the mean of its divisors is an integer number (5000505555466).
Almost surely, 210001011110931 is an apocalyptic number.
10001011110931 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001011110931 is an equidigital number, since it uses as much as digits as its factorization.
10001011110931 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 10001011110931 its reverse (13901111010001), we get a palindrome (23902122120932).
The spelling of 10001011110931 in words is "ten trillion, one billion, eleven million, one hundred ten thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •