Base | Representation |
---|---|
bin | 1010011110000110010111… |
… | …10000100001011100010101 |
3 | 10000112010010000221001200202 |
4 | 11033003023300201130111 |
5 | 11004213024424420201 |
6 | 120545141100150245 |
7 | 4564314111041363 |
oct | 517031360413425 |
9 | 100463100831622 |
10 | 23024443201301 |
11 | 737767aa39723 |
12 | 26ba35b538385 |
13 | cb0270b99259 |
14 | 59856359c633 |
15 | 29ddba464c6b |
hex | 14f0cbc21715 |
23024443201301 has 2 divisors, whose sum is σ = 23024443201302. Its totient is φ = 23024443201300.
The previous prime is 23024443201241. The next prime is 23024443201303. The reversal of 23024443201301 is 10310234442032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18559467124900 + 4464976076401 = 4308070^2 + 2113049^2 .
It is a cyclic number.
It is not a de Polignac number, because 23024443201301 - 26 = 23024443201237 is a prime.
Together with 23024443201303, 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 (23024443201303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11512221600650 + 11512221600651.
It is an arithmetic number, because the mean of its divisors is an integer number (11512221600651).
Almost surely, 223024443201301 is an apocalyptic number.
It is an amenable number.
23024443201301 is a deficient number, since it is larger than the sum of its proper divisors (1).
23024443201301 is an equidigital number, since it uses as much as digits as its factorization.
23024443201301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 23024443201301 its reverse (10310234442032), we get a palindrome (33334677643333).
The spelling of 23024443201301 in words is "twenty-three trillion, twenty-four billion, four hundred forty-three million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •