Base | Representation |
---|---|
bin | 1010100011100010010010… |
… | …10011011100100101001001 |
3 | 10001011222020202002011212202 |
4 | 11101301021103130211021 |
5 | 11020243101133232103 |
6 | 121211032052045545 |
7 | 4613645665021655 |
oct | 521611123344511 |
9 | 101158222064782 |
10 | 23211233102153 |
11 | 7439912a74908 |
12 | 272a5ab0038b5 |
13 | cc4a6b4346c5 |
14 | 5a3603063a65 |
15 | 2a3b9dcd5988 |
hex | 151c494dc949 |
23211233102153 has 2 divisors, whose sum is σ = 23211233102154. Its totient is φ = 23211233102152.
The previous prime is 23211233102107. The next prime is 23211233102219. The reversal of 23211233102153 is 35120133211232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12456749065744 + 10754484036409 = 3529412^2 + 3279403^2 .
It is a cyclic number.
It is not a de Polignac number, because 23211233102153 - 214 = 23211233085769 is a prime.
It is a super-2 number, since 2×232112331021532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23211233182153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11605616551076 + 11605616551077.
It is an arithmetic number, because the mean of its divisors is an integer number (11605616551077).
Almost surely, 223211233102153 is an apocalyptic number.
It is an amenable number.
23211233102153 is a deficient number, since it is larger than the sum of its proper divisors (1).
23211233102153 is an equidigital number, since it uses as much as digits as its factorization.
23211233102153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 23211233102153 its reverse (35120133211232), we get a palindrome (58331366313385).
The spelling of 23211233102153 in words is "twenty-three trillion, two hundred eleven billion, two hundred thirty-three million, one hundred two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •