Base | Representation |
---|---|
bin | 1010100100000111001000… |
… | …00111011110110101000101 |
3 | 10001020212022001101002120011 |
4 | 11102003210013132311011 |
5 | 11021104102114201201 |
6 | 121224102342110221 |
7 | 4615246043324353 |
oct | 522034407366505 |
9 | 101225261332504 |
10 | 23231010303301 |
11 | 7447241759849 |
12 | 27323aa41b371 |
13 | cc68a09019a8 |
14 | 5a455b9107d3 |
15 | 2a445a1e2151 |
hex | 1520e41ded45 |
23231010303301 has 2 divisors, whose sum is σ = 23231010303302. Its totient is φ = 23231010303300.
The previous prime is 23231010303197. The next prime is 23231010303329. The reversal of 23231010303301 is 10330301013232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14748295803201 + 8482714500100 = 3840351^2 + 2912510^2 .
It is a cyclic number.
It is not a de Polignac number, because 23231010303301 - 29 = 23231010302789 is a prime.
It is a super-2 number, since 2×232310103033012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23231010303901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11615505151650 + 11615505151651.
It is an arithmetic number, because the mean of its divisors is an integer number (11615505151651).
Almost surely, 223231010303301 is an apocalyptic number.
It is an amenable number.
23231010303301 is a deficient number, since it is larger than the sum of its proper divisors (1).
23231010303301 is an equidigital number, since it uses as much as digits as its factorization.
23231010303301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 23231010303301 its reverse (10330301013232), we get a palindrome (33561311316533).
The spelling of 23231010303301 in words is "twenty-three trillion, two hundred thirty-one billion, ten million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •