Base | Representation |
---|---|
bin | 1010100100001101010100… |
… | …00011011001000110000001 |
3 | 10001021011212111002001200021 |
4 | 11102012222003121012001 |
5 | 11021132402231320001 |
6 | 121225412050453441 |
7 | 4615424245646611 |
oct | 522065203310601 |
9 | 101234774061607 |
10 | 23234331120001 |
11 | 7448696221561 |
12 | 2732b76594281 |
13 | cc6cac8c20a1 |
14 | 5a4794988a41 |
15 | 2a45a1a07ba1 |
hex | 1521aa0d9181 |
23234331120001 has 2 divisors, whose sum is σ = 23234331120002. Its totient is φ = 23234331120000.
The previous prime is 23234331119981. The next prime is 23234331120019. The reversal of 23234331120001 is 10002113343232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22576324617025 + 658006502976 = 4751455^2 + 811176^2 .
It is a cyclic number.
It is not a de Polignac number, because 23234331120001 - 27 = 23234331119873 is a prime.
It is not a weakly prime, because it can be changed into another prime (23234331120101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11617165560000 + 11617165560001.
It is an arithmetic number, because the mean of its divisors is an integer number (11617165560001).
Almost surely, 223234331120001 is an apocalyptic number.
It is an amenable number.
23234331120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
23234331120001 is an equidigital number, since it uses as much as digits as its factorization.
23234331120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 23234331120001 its reverse (10002113343232), we get a palindrome (33236444463233).
The spelling of 23234331120001 in words is "twenty-three trillion, two hundred thirty-four billion, three hundred thirty-one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •