Base | Representation |
---|---|
bin | 1010100001100111010010… |
… | …11111111000110010001111 |
3 | 10000221122210212111002111011 |
4 | 11100303221133320302033 |
5 | 11013202333004204411 |
6 | 121120431512110051 |
7 | 4606120443326626 |
oct | 520635137706217 |
9 | 100848725432434 |
10 | 23145201241231 |
11 | 7413908785423 |
12 | 2719841095327 |
13 | cbb777134754 |
14 | 5a033b46a6bd |
15 | 2a20d6c54c21 |
hex | 150ce97f8c8f |
23145201241231 has 2 divisors, whose sum is σ = 23145201241232. Its totient is φ = 23145201241230.
The previous prime is 23145201241223. The next prime is 23145201241243. The reversal of 23145201241231 is 13214210254132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23145201241231 - 23 = 23145201241223 is a prime.
It is a super-2 number, since 2×231452012412312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23145201241193 and 23145201241202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23145201241291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11572600620615 + 11572600620616.
It is an arithmetic number, because the mean of its divisors is an integer number (11572600620616).
Almost surely, 223145201241231 is an apocalyptic number.
23145201241231 is a deficient number, since it is larger than the sum of its proper divisors (1).
23145201241231 is an equidigital number, since it uses as much as digits as its factorization.
23145201241231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 23145201241231 its reverse (13214210254132), we get a palindrome (36359411495363).
The spelling of 23145201241231 in words is "twenty-three trillion, one hundred forty-five billion, two hundred one million, two hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •