Base | Representation |
---|---|
bin | 1010100110101110111111… |
… | …10111000110010111010001 |
3 | 10001120110220212112021021122 |
4 | 11103113133313012113101 |
5 | 11024043140100310022 |
6 | 121333325232532025 |
7 | 4624616264401544 |
oct | 523273767062721 |
9 | 101513825467248 |
10 | 23321133213137 |
11 | 7481489799911 |
12 | 27479603b1015 |
13 | 1002234029486 |
14 | 5a8a6ac8485b |
15 | 2a698224b742 |
hex | 1535dfdc65d1 |
23321133213137 has 2 divisors, whose sum is σ = 23321133213138. Its totient is φ = 23321133213136.
The previous prime is 23321133213061. The next prime is 23321133213151. The reversal of 23321133213137 is 73131233112332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23009904234496 + 311228978641 = 4796864^2 + 557879^2 .
It is a cyclic number.
It is not a de Polignac number, because 23321133213137 - 212 = 23321133209041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23321133213097 and 23321133213106.
It is not a weakly prime, because it can be changed into another prime (23321133213167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11660566606568 + 11660566606569.
It is an arithmetic number, because the mean of its divisors is an integer number (11660566606569).
Almost surely, 223321133213137 is an apocalyptic number.
It is an amenable number.
23321133213137 is a deficient number, since it is larger than the sum of its proper divisors (1).
23321133213137 is an equidigital number, since it uses as much as digits as its factorization.
23321133213137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40824, while the sum is 35.
Adding to 23321133213137 its reverse (73131233112332), we get a palindrome (96452366325469).
The spelling of 23321133213137 in words is "twenty-three trillion, three hundred twenty-one billion, one hundred thirty-three million, two hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •