Base | Representation |
---|---|
bin | 1001000110101110101000… |
… | …0010000100010010010101 |
3 | 1022110001122202101212122112 |
4 | 2101223222002010102111 |
5 | 2303010414223210234 |
6 | 33143025404240405 |
7 | 2052166605511052 |
oct | 221535202042225 |
9 | 38401582355575 |
10 | 10011200210069 |
11 | 320a7a9588683 |
12 | 11582a2840105 |
13 | 57808a6b1966 |
14 | 26878a838029 |
15 | 12563337dace |
hex | 91aea084495 |
10011200210069 has 2 divisors, whose sum is σ = 10011200210070. Its totient is φ = 10011200210068.
The previous prime is 10011200210021. The next prime is 10011200210113. The reversal of 10011200210069 is 96001200211001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7863890973169 + 2147309236900 = 2804263^2 + 1465370^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011200210069 - 212 = 10011200205973 is a prime.
It is a super-2 number, since 2×100112002100692 (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 (10011200210369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005600105034 + 5005600105035.
It is an arithmetic number, because the mean of its divisors is an integer number (5005600105035).
Almost surely, 210011200210069 is an apocalyptic number.
It is an amenable number.
10011200210069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011200210069 is an equidigital number, since it uses as much as digits as its factorization.
10011200210069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 10011200210069 in words is "ten trillion, eleven billion, two hundred million, two hundred ten thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •