Base | Representation |
---|---|
bin | 1010110010101101110000… |
… | …10001010101110101111101 |
3 | 10010000211110122121122021022 |
4 | 11121112320101111311331 |
5 | 11102314221140122221 |
6 | 122250405153513525 |
7 | 4666431362243021 |
oct | 531267021256575 |
9 | 103024418548238 |
10 | 23732785864061 |
11 | 76200219a932a |
12 | 27b36a5b728a5 |
13 | 1031cb8863921 |
14 | 5c095c888381 |
15 | 2b2526b524ab |
hex | 1595b8455d7d |
23732785864061 has 2 divisors, whose sum is σ = 23732785864062. Its totient is φ = 23732785864060.
The previous prime is 23732785864013. The next prime is 23732785864147. The reversal of 23732785864061 is 16046858723732.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12176226408025 + 11556559456036 = 3489445^2 + 3399494^2 .
It is a cyclic number.
It is not a de Polignac number, because 23732785864061 - 234 = 23715605994877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23732785863985 and 23732785864003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23732782864061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11866392932030 + 11866392932031.
It is an arithmetic number, because the mean of its divisors is an integer number (11866392932031).
Almost surely, 223732785864061 is an apocalyptic number.
It is an amenable number.
23732785864061 is a deficient number, since it is larger than the sum of its proper divisors (1).
23732785864061 is an equidigital number, since it uses as much as digits as its factorization.
23732785864061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81285120, while the sum is 62.
The spelling of 23732785864061 in words is "twenty-three trillion, seven hundred thirty-two billion, seven hundred eighty-five million, eight hundred sixty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •