Base | Representation |
---|---|
bin | 1010011110101110101001… |
… | …01111101010100110101101 |
3 | 10000121011221011022201021001 |
4 | 11033113110233222212231 |
5 | 11010041322103324414 |
6 | 121003115020040301 |
7 | 4566011032465624 |
oct | 517272457524655 |
9 | 100534834281231 |
10 | 23046068808109 |
11 | 738586803a146 |
12 | 2702595993091 |
13 | cb23092a40b9 |
14 | 5996157226bb |
15 | 29e733c8c074 |
hex | 14f5d4bea9ad |
23046068808109 has 2 divisors, whose sum is σ = 23046068808110. Its totient is φ = 23046068808108.
The previous prime is 23046068808101. The next prime is 23046068808121. The reversal of 23046068808109 is 90180886064032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21388747291209 + 1657321516900 = 4624797^2 + 1287370^2 .
It is a cyclic number.
It is not a de Polignac number, because 23046068808109 - 23 = 23046068808101 is a prime.
It is a super-2 number, since 2×230460688081092 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23046068808109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23046068808101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11523034404054 + 11523034404055.
It is an arithmetic number, because the mean of its divisors is an integer number (11523034404055).
Almost surely, 223046068808109 is an apocalyptic number.
It is an amenable number.
23046068808109 is a deficient number, since it is larger than the sum of its proper divisors (1).
23046068808109 is an equidigital number, since it uses as much as digits as its factorization.
23046068808109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3981312, while the sum is 55.
The spelling of 23046068808109 in words is "twenty-three trillion, forty-six billion, sixty-eight million, eight hundred eight thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •