Base | Representation |
---|---|
bin | 1010100000010111011101… |
… | …11110010100000100100001 |
3 | 10000210120012000221201120022 |
4 | 11100023232332110010201 |
5 | 11012002044404233213 |
6 | 121045023044323225 |
7 | 4603042415052131 |
oct | 520135676240441 |
9 | 100716160851508 |
10 | 23102343430433 |
11 | 73a7715653883 |
12 | 27114800a3515 |
13 | cb7706c935a7 |
14 | 59c23350aac1 |
15 | 2a0e29414308 |
hex | 1502eef94121 |
23102343430433 has 2 divisors, whose sum is σ = 23102343430434. Its totient is φ = 23102343430432.
The previous prime is 23102343430417. The next prime is 23102343430477. The reversal of 23102343430433 is 33403434320132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21022151640064 + 2080191790369 = 4584992^2 + 1442287^2 .
It is a cyclic number.
It is not a de Polignac number, because 23102343430433 - 24 = 23102343430417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23102343430393 and 23102343430402.
It is not a weakly prime, because it can be changed into another prime (23102343432433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11551171715216 + 11551171715217.
It is an arithmetic number, because the mean of its divisors is an integer number (11551171715217).
Almost surely, 223102343430433 is an apocalyptic number.
It is an amenable number.
23102343430433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23102343430433 is an equidigital number, since it uses as much as digits as its factorization.
23102343430433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624, while the sum is 35.
Adding to 23102343430433 its reverse (33403434320132), we get a palindrome (56505777750565).
The spelling of 23102343430433 in words is "twenty-three trillion, one hundred two billion, three hundred forty-three million, four hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •