Base | Representation |
---|---|
bin | 1010100110011100010011… |
… | …10110101000001001101111 |
3 | 10001112112000122212012022222 |
4 | 11103032021312220021233 |
5 | 11023412113140023343 |
6 | 121324545513025555 |
7 | 4624112540225441 |
oct | 523161166501157 |
9 | 101475018765288 |
10 | 23311100314223 |
11 | 7478200454417 |
12 | 2745a203b52bb |
13 | 10012c55906b7 |
14 | 5a83985da491 |
15 | 2a6596540a68 |
hex | 153389da826f |
23311100314223 has 2 divisors, whose sum is σ = 23311100314224. Its totient is φ = 23311100314222.
The previous prime is 23311100314213. The next prime is 23311100314277. The reversal of 23311100314223 is 32241300111332.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23311100314223 - 240 = 22211588686447 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23311100314192 and 23311100314201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23311100314213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11655550157111 + 11655550157112.
It is an arithmetic number, because the mean of its divisors is an integer number (11655550157112).
Almost surely, 223311100314223 is an apocalyptic number.
23311100314223 is a deficient number, since it is larger than the sum of its proper divisors (1).
23311100314223 is an equidigital number, since it uses as much as digits as its factorization.
23311100314223 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 26.
Adding to 23311100314223 its reverse (32241300111332), we get a palindrome (55552400425555).
The spelling of 23311100314223 in words is "twenty-three trillion, three hundred eleven billion, one hundred million, three hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •