Base | Representation |
---|---|
bin | 1010100111101011101000… |
… | …01110110101001100100001 |
3 | 10001200120221121122211200121 |
4 | 11103311310032311030201 |
5 | 11030111322412431223 |
6 | 121400311422320241 |
7 | 4630151066116423 |
oct | 523656416651441 |
9 | 101616847584617 |
10 | 23353687233313 |
11 | 7494274683018 |
12 | 2752126729081 |
13 | 1005321585bc8 |
14 | 5aa4785a2813 |
15 | 2a773a1c215d |
hex | 153d743b5321 |
23353687233313 has 2 divisors, whose sum is σ = 23353687233314. Its totient is φ = 23353687233312.
The previous prime is 23353687233311. The next prime is 23353687233323. The reversal of 23353687233313 is 31333278635332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14002953170704 + 9350734062609 = 3742052^2 + 3057897^2 .
It is a cyclic number.
It is not a de Polignac number, because 23353687233313 - 21 = 23353687233311 is a prime.
Together with 23353687233311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (23353687233311) 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, 11676843616656 + 11676843616657.
It is an arithmetic number, because the mean of its divisors is an integer number (11676843616657).
Almost surely, 223353687233313 is an apocalyptic number.
It is an amenable number.
23353687233313 is a deficient number, since it is larger than the sum of its proper divisors (1).
23353687233313 is an equidigital number, since it uses as much as digits as its factorization.
23353687233313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14696640, while the sum is 52.
The spelling of 23353687233313 in words is "twenty-three trillion, three hundred fifty-three billion, six hundred eighty-seven million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •