Base | Representation |
---|---|
bin | 1010100111010111110001… |
… | …01101110000100001101001 |
3 | 10001122120102112211212010202 |
4 | 11103223320231300201221 |
5 | 11024423003402000043 |
6 | 121351345422321545 |
7 | 4626322630650323 |
oct | 523537055604151 |
9 | 101576375755122 |
10 | 23343025031273 |
11 | 748a7a30958a2 |
12 | 275004ba292b5 |
13 | 100431263180c |
14 | 5a9b46504613 |
15 | 2a731410b1b8 |
hex | 153af8b70869 |
23343025031273 has 2 divisors, whose sum is σ = 23343025031274. Its totient is φ = 23343025031272.
The previous prime is 23343025031159. The next prime is 23343025031321. The reversal of 23343025031273 is 37213052034332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19662812512729 + 3680212518544 = 4434277^2 + 1918388^2 .
It is a cyclic number.
It is not a de Polignac number, because 23343025031273 - 214 = 23343025014889 is a prime.
It is a super-2 number, since 2×233430250312732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23343025331273) 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, 11671512515636 + 11671512515637.
It is an arithmetic number, because the mean of its divisors is an integer number (11671512515637).
Almost surely, 223343025031273 is an apocalyptic number.
It is an amenable number.
23343025031273 is a deficient number, since it is larger than the sum of its proper divisors (1).
23343025031273 is an equidigital number, since it uses as much as digits as its factorization.
23343025031273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 38.
The spelling of 23343025031273 in words is "twenty-three trillion, three hundred forty-three billion, twenty-five million, thirty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •