Base | Representation |
---|---|
bin | 1010100110111000001001… |
… | …10010100100100100110001 |
3 | 10001120221121101002122002002 |
4 | 11103130010302210210301 |
5 | 11024133221211003244 |
6 | 121335501032303345 |
7 | 4625152131311633 |
oct | 523340462444461 |
9 | 101527541078062 |
10 | 23326047750449 |
11 | 74835809344a4 |
12 | 27488b2241b55 |
13 | 1002838264412 |
14 | 5a8db585aa53 |
15 | 2a6b6d920a4e |
hex | 153704ca4931 |
23326047750449 has 2 divisors, whose sum is σ = 23326047750450. Its totient is φ = 23326047750448.
The previous prime is 23326047750413. The next prime is 23326047750461. The reversal of 23326047750449 is 94405774062332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18355569235600 + 4970478514849 = 4284340^2 + 2229457^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23326047750449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23326047750394 and 23326047750403.
It is not a weakly prime, because it can be changed into another prime (23326047750479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11663023875224 + 11663023875225.
It is an arithmetic number, because the mean of its divisors is an integer number (11663023875225).
Almost surely, 223326047750449 is an apocalyptic number.
It is an amenable number.
23326047750449 is a deficient number, since it is larger than the sum of its proper divisors (1).
23326047750449 is an equidigital number, since it uses as much as digits as its factorization.
23326047750449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30481920, while the sum is 56.
The spelling of 23326047750449 in words is "twenty-three trillion, three hundred twenty-six billion, forty-seven million, seven hundred fifty thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •