Base | Representation |
---|---|
bin | 1010101011100010100010… |
… | …11110010011011100000111 |
3 | 10002011021010000021012220112 |
4 | 11111301101132103130013 |
5 | 11034244314001313332 |
6 | 121541233341223235 |
7 | 4642553056504541 |
oct | 525612136233407 |
9 | 102137100235815 |
10 | 23486248072967 |
11 | 753550982a959 |
12 | 2773960b61b1b |
13 | 1014988b6c074 |
14 | 5b2a51bd8691 |
15 | 2aade7c7cdb2 |
hex | 155c51793707 |
23486248072967 has 2 divisors, whose sum is σ = 23486248072968. Its totient is φ = 23486248072966.
The previous prime is 23486248072883. The next prime is 23486248073017. The reversal of 23486248072967 is 76927084268432.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 23486248072967 - 232 = 23481953105671 is a prime.
It is a super-2 number, since 2×234862480729672 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23486248072897 and 23486248072906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23486248071967) 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, 11743124036483 + 11743124036484.
It is an arithmetic number, because the mean of its divisors is an integer number (11743124036484).
Almost surely, 223486248072967 is an apocalyptic number.
23486248072967 is a deficient number, since it is larger than the sum of its proper divisors (1).
23486248072967 is an equidigital number, since it uses as much as digits as its factorization.
23486248072967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 390168576, while the sum is 68.
The spelling of 23486248072967 in words is "twenty-three trillion, four hundred eighty-six billion, two hundred forty-eight million, seventy-two thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •