Base | Representation |
---|---|
bin | 1001010111100010100010… |
… | …0111110110101100100101 |
3 | 1100110200010121211102222212 |
4 | 2111320220213312230211 |
5 | 2322223411324041401 |
6 | 33523432151133205 |
7 | 2112102632620436 |
oct | 225705047665445 |
9 | 40420117742885 |
10 | 10300013112101 |
11 | 3311235976669 |
12 | 11a4265674205 |
13 | 5993968c836b |
14 | 278747cc548d |
15 | 12cdd8841dbb |
hex | 95e289f6b25 |
10300013112101 has 2 divisors, whose sum is σ = 10300013112102. Its totient is φ = 10300013112100.
The previous prime is 10300013112049. The next prime is 10300013112133. The reversal of 10300013112101 is 10121131000301.
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., 10293824143201 + 6188968900 = 3208399^2 + 78670^2 .
It is a cyclic number.
It is not a de Polignac number, because 10300013112101 - 230 = 10298939370277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10300013114101) 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, 5150006556050 + 5150006556051.
It is an arithmetic number, because the mean of its divisors is an integer number (5150006556051).
Almost surely, 210300013112101 is an apocalyptic number.
It is an amenable number.
10300013112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300013112101 is an equidigital number, since it uses as much as digits as its factorization.
10300013112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10300013112101 its reverse (10121131000301), we get a palindrome (20421144112402).
The spelling of 10300013112101 in words is "ten trillion, three hundred billion, thirteen million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •