Base | Representation |
---|---|
bin | 1010011101011111000000… |
… | …01100101101111011001101 |
3 | 10000110002120022112021011202 |
4 | 11032233200030231323031 |
5 | 11003341240143102201 |
6 | 120531324134155245 |
7 | 4562635332614513 |
oct | 516574014557315 |
9 | 100402508467152 |
10 | 23003311300301 |
11 | 7369716596732 |
12 | 26b62424b2b25 |
13 | cab283b51617 |
14 | 59751ac324b3 |
15 | 29d580160c6b |
hex | 14ebe032decd |
23003311300301 has 2 divisors, whose sum is σ = 23003311300302. Its totient is φ = 23003311300300.
The previous prime is 23003311300273. The next prime is 23003311300303. The reversal of 23003311300301 is 10300311330032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17560072344676 + 5443238955625 = 4190474^2 + 2333075^2 .
It is a cyclic number.
It is not a de Polignac number, because 23003311300301 - 214 = 23003311283917 is a prime.
Together with 23003311300303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23003311300303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11501655650150 + 11501655650151.
It is an arithmetic number, because the mean of its divisors is an integer number (11501655650151).
Almost surely, 223003311300301 is an apocalyptic number.
It is an amenable number.
23003311300301 is a deficient number, since it is larger than the sum of its proper divisors (1).
23003311300301 is an equidigital number, since it uses as much as digits as its factorization.
23003311300301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 23003311300301 its reverse (10300311330032), we get a palindrome (33303622630333).
The spelling of 23003311300301 in words is "twenty-three trillion, three billion, three hundred eleven million, three hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •