Base | Representation |
---|---|
bin | 1010011110101001100000… |
… | …10100110110001000111111 |
3 | 10000120220210220201200210022 |
4 | 11033110300110312020333 |
5 | 11010020144420022142 |
6 | 121001541200002355 |
7 | 4565552465620112 |
oct | 517246024661077 |
9 | 100526726650708 |
10 | 23043310314047 |
11 | 7384681a30791 |
12 | 2701b460003bb |
13 | cb1c89949caa |
14 | 599433224579 |
15 | 29e621a006d2 |
hex | 14f53053623f |
23043310314047 has 2 divisors, whose sum is σ = 23043310314048. Its totient is φ = 23043310314046.
The previous prime is 23043310313993. The next prime is 23043310314067. The reversal of 23043310314047 is 74041301334032.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23043310314047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23043310313998 and 23043310314016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23043310314067) 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, 11521655157023 + 11521655157024.
It is an arithmetic number, because the mean of its divisors is an integer number (11521655157024).
Almost surely, 223043310314047 is an apocalyptic number.
23043310314047 is a deficient number, since it is larger than the sum of its proper divisors (1).
23043310314047 is an equidigital number, since it uses as much as digits as its factorization.
23043310314047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 35.
Adding to 23043310314047 its reverse (74041301334032), we get a palindrome (97084611648079).
The spelling of 23043310314047 in words is "twenty-three trillion, forty-three billion, three hundred ten million, three hundred fourteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •