Base | Representation |
---|---|
bin | 1010100011111000011001… |
… | …01001110000111100010001 |
3 | 10001020002212210120122001022 |
4 | 11101330030221300330101 |
5 | 11020441402203210213 |
6 | 121220313422245225 |
7 | 4614546035535341 |
oct | 521741451607421 |
9 | 101202783518038 |
10 | 23223100444433 |
11 | 74439528597aa |
12 | 2730961426815 |
13 | cc5c0cc5cb26 |
14 | 5a400b1ccd21 |
15 | 2a4145aa0308 |
hex | 151f0ca70f11 |
23223100444433 has 2 divisors, whose sum is σ = 23223100444434. Its totient is φ = 23223100444432.
The previous prime is 23223100444393. The next prime is 23223100444441. The reversal of 23223100444433 is 33444400132232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23025957340369 + 197143104064 = 4798537^2 + 444008^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23223100444433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23223100444393 and 23223100444402.
It is not a weakly prime, because it can be changed into another prime (23223100444133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11611550222216 + 11611550222217.
It is an arithmetic number, because the mean of its divisors is an integer number (11611550222217).
Almost surely, 223223100444433 is an apocalyptic number.
It is an amenable number.
23223100444433 is a deficient number, since it is larger than the sum of its proper divisors (1).
23223100444433 is an equidigital number, since it uses as much as digits as its factorization.
23223100444433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 35.
Adding to 23223100444433 its reverse (33444400132232), we get a palindrome (56667500576665).
The spelling of 23223100444433 in words is "twenty-three trillion, two hundred twenty-three billion, one hundred million, four hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •