Base | Representation |
---|---|
bin | 1010011101011101001010… |
… | …01111111111000011000001 |
3 | 10000110000000101112220100111 |
4 | 11032232211033333003001 |
5 | 11003332224002113441 |
6 | 120531042044351321 |
7 | 4562601663352132 |
oct | 516564517770301 |
9 | 100400011486314 |
10 | 23002322301121 |
11 | 73692592a6a39 |
12 | 26b6007245541 |
13 | cab156c966c7 |
14 | 597465749c89 |
15 | 29d523404081 |
hex | 14eba53ff0c1 |
23002322301121 has 2 divisors, whose sum is σ = 23002322301122. Its totient is φ = 23002322301120.
The previous prime is 23002322301103. The next prime is 23002322301181. The reversal of 23002322301121 is 12110322320032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21605763240000 + 1396559061121 = 4648200^2 + 1181761^2 .
It is a cyclic number.
It is not a de Polignac number, because 23002322301121 - 239 = 22452566487233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23002322301092 and 23002322301101.
It is not a weakly prime, because it can be changed into another prime (23002322301181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11501161150560 + 11501161150561.
It is an arithmetic number, because the mean of its divisors is an integer number (11501161150561).
Almost surely, 223002322301121 is an apocalyptic number.
It is an amenable number.
23002322301121 is a deficient number, since it is larger than the sum of its proper divisors (1).
23002322301121 is an equidigital number, since it uses as much as digits as its factorization.
23002322301121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 23002322301121 its reverse (12110322320032), we get a palindrome (35112644621153).
The spelling of 23002322301121 in words is "twenty-three trillion, two billion, three hundred twenty-two million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •