Base | Representation |
---|---|
bin | 1001010111100010111001… |
… | …1110000111011000011101 |
3 | 1100110200101110102221212222 |
4 | 2111320232132013120131 |
5 | 2322224111433103201 |
6 | 33523450014035125 |
7 | 2112105233552135 |
oct | 225705636073035 |
9 | 40420343387788 |
10 | 10300111222301 |
11 | 331128629727a |
12 | 11a42924a8aa5 |
13 | 5993b1029934 |
14 | 278756d43ac5 |
15 | 12cde227191b |
hex | 95e2e78761d |
10300111222301 has 2 divisors, whose sum is σ = 10300111222302. Its totient is φ = 10300111222300.
The previous prime is 10300111222249. The next prime is 10300111222339. The reversal of 10300111222301 is 10322211100301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8531224522276 + 1768886700025 = 2920826^2 + 1329995^2 .
It is a cyclic number.
It is not a de Polignac number, because 10300111222301 - 26 = 10300111222237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10300111222301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10300111222001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150055611150 + 5150055611151.
It is an arithmetic number, because the mean of its divisors is an integer number (5150055611151).
Almost surely, 210300111222301 is an apocalyptic number.
It is an amenable number.
10300111222301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300111222301 is an equidigital number, since it uses as much as digits as its factorization.
10300111222301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10300111222301 its reverse (10322211100301), we get a palindrome (20622322322602).
The spelling of 10300111222301 in words is "ten trillion, three hundred billion, one hundred eleven million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •