Base | Representation |
---|---|
bin | 1010011110101010111111… |
… | …00001101001111001101101 |
3 | 10000120222212002210201101112 |
4 | 11033111133201221321231 |
5 | 11010023310130412231 |
6 | 121002151524521405 |
7 | 4565611222553213 |
oct | 517253741517155 |
9 | 100528762721345 |
10 | 23044102200941 |
11 | 7384a48a30068 |
12 | 2702127250265 |
13 | cb2084a1c113 |
14 | 5994aa47acb3 |
15 | 29e66b2c392b |
hex | 14f55f869e6d |
23044102200941 has 2 divisors, whose sum is σ = 23044102200942. Its totient is φ = 23044102200940.
The previous prime is 23044102200929. The next prime is 23044102200989. The reversal of 23044102200941 is 14900220144032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22592815176100 + 451287024841 = 4753190^2 + 671779^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23044102200941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23044102200898 and 23044102200907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23044101200941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11522051100470 + 11522051100471.
It is an arithmetic number, because the mean of its divisors is an integer number (11522051100471).
Almost surely, 223044102200941 is an apocalyptic number.
It is an amenable number.
23044102200941 is a deficient number, since it is larger than the sum of its proper divisors (1).
23044102200941 is an equidigital number, since it uses as much as digits as its factorization.
23044102200941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 23044102200941 its reverse (14900220144032), we get a palindrome (37944322344973).
The spelling of 23044102200941 in words is "twenty-three trillion, forty-four billion, one hundred two million, two hundred thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •