Base | Representation |
---|---|
bin | 1001010111101011011110… |
… | …0000000001010000101101 |
3 | 1100110220022200101010120012 |
4 | 2111322313200001100231 |
5 | 2322243314002400414 |
6 | 33524510101103005 |
7 | 2112216220545266 |
oct | 225726740012055 |
9 | 40426280333505 |
10 | 10302410200109 |
11 | 3312255a7a335 |
12 | 11a48143b7a65 |
13 | 599689404731 |
14 | 2788d43c796d |
15 | 12cec8ee033e |
hex | 95eb780142d |
10302410200109 has 2 divisors, whose sum is σ = 10302410200110. Its totient is φ = 10302410200108.
The previous prime is 10302410200091. The next prime is 10302410200189. The reversal of 10302410200109 is 90100201420301.
Together with previous prime (10302410200091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7529552464009 + 2772857736100 = 2744003^2 + 1665190^2 .
It is a cyclic number.
It is not a de Polignac number, because 10302410200109 - 28 = 10302410199853 is a prime.
It is a super-2 number, since 2×103024102001092 (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 (10302410200189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151205100054 + 5151205100055.
It is an arithmetic number, because the mean of its divisors is an integer number (5151205100055).
Almost surely, 210302410200109 is an apocalyptic number.
It is an amenable number.
10302410200109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302410200109 is an equidigital number, since it uses as much as digits as its factorization.
10302410200109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 10302410200109 in words is "ten trillion, three hundred two billion, four hundred ten million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •