Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …1001111100010101101101 |
3 | 1022110001102110122201200011 |
4 | 2101223210221330111231 |
5 | 2303010223124444411 |
6 | 33143012422533221 |
7 | 2052164431651636 |
oct | 221534451742555 |
9 | 38401373581604 |
10 | 10011109999981 |
11 | 320a762673492 |
12 | 1158278597211 |
13 | 578074ab81cc |
14 | 26877c87488d |
15 | 12562a4aec21 |
hex | 91ae4a7c56d |
10011109999981 has 2 divisors, whose sum is σ = 10011109999982. Its totient is φ = 10011109999980.
The previous prime is 10011109999963. The next prime is 10011109999991. The reversal of 10011109999981 is 18999990111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6612123674025 + 3398986325956 = 2571405^2 + 1843634^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011109999981 - 215 = 10011109967213 is a prime.
It is a super-2 number, since 2×100111099999812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011109999931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005554999990 + 5005554999991.
It is an arithmetic number, because the mean of its divisors is an integer number (5005554999991).
Almost surely, 210011109999981 is an apocalyptic number.
It is an amenable number.
10011109999981 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011109999981 is an equidigital number, since it uses as much as digits as its factorization.
10011109999981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 472392, while the sum is 58.
The spelling of 10011109999981 in words is "ten trillion, eleven billion, one hundred nine million, nine hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •