Base | Representation |
---|---|
bin | 10010110101011101… |
… | …01110001110011001 |
3 | 222002201202112022011 |
4 | 21122232232032121 |
5 | 131202201210433 |
6 | 4351230025521 |
7 | 505405463245 |
oct | 113256561631 |
9 | 28081675264 |
10 | 10112131993 |
11 | 431a042487 |
12 | 1b626482a1 |
13 | c51cbb072 |
14 | 6bcdd1425 |
15 | 3e2b5c3cd |
hex | 25abae399 |
10112131993 has 2 divisors, whose sum is σ = 10112131994. Its totient is φ = 10112131992.
The previous prime is 10112131933. The next prime is 10112132011. The reversal of 10112131993 is 39913121101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8131169929 + 1980962064 = 90173^2 + 44508^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112131993 - 221 = 10110034841 is a prime.
It is not a weakly prime, because it can be changed into another prime (10112131933) 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 as a sum of consecutive naturals, namely, 5056065996 + 5056065997.
It is an arithmetic number, because the mean of its divisors is an integer number (5056065997).
Almost surely, 210112131993 is an apocalyptic number.
It is an amenable number.
10112131993 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112131993 is an equidigital number, since it uses as much as digits as its factorization.
10112131993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 10112131993 in words is "ten billion, one hundred twelve million, one hundred thirty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •