Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0111111100101111111001 |
3 | 1022102000001000000001210101 |
4 | 2101201111013330233321 |
5 | 2302320212133343111 |
6 | 33133553225515401 |
7 | 2051325045416566 |
oct | 221412507745771 |
9 | 38360030001711 |
10 | 10000112012281 |
11 | 320602958a556 |
12 | 1156109342b61 |
13 | 577011416791 |
14 | 268017d6986d |
15 | 1251d4bbbbc1 |
hex | 918551fcbf9 |
10000112012281 has 2 divisors, whose sum is σ = 10000112012282. Its totient is φ = 10000112012280.
The previous prime is 10000112012279. The next prime is 10000112012311. The reversal of 10000112012281 is 18221021100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5000326571881 + 4999785440400 = 2236141^2 + 2236020^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000112012281 - 21 = 10000112012279 is a prime.
It is a super-2 number, since 2×100001120122812 (a number of 27 digits) contains 22 as substring.
Together with 10000112012279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10000112012221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000056006140 + 5000056006141.
It is an arithmetic number, because the mean of its divisors is an integer number (5000056006141).
Almost surely, 210000112012281 is an apocalyptic number.
It is an amenable number.
10000112012281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000112012281 is an equidigital number, since it uses as much as digits as its factorization.
10000112012281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 10000112012281 its reverse (18221021100001), we get a palindrome (28221133112282).
The spelling of 10000112012281 in words is "ten trillion, one hundred twelve million, twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •