Base | Representation |
---|---|
bin | 1001010011101000111010… |
… | …0101010011110100001001 |
3 | 1100020021011122211021000211 |
4 | 2110322032211103310021 |
5 | 2320124143041303413 |
6 | 33432551030401121 |
7 | 2104211245630561 |
oct | 224721645236411 |
9 | 40207148737024 |
10 | 10233004244233 |
11 | 329587a138421 |
12 | 11932845001a1 |
13 | 592c7807baa4 |
14 | 2753cc647da1 |
15 | 12b2b5b2283d |
hex | 94e8e953d09 |
10233004244233 has 2 divisors, whose sum is σ = 10233004244234. Its totient is φ = 10233004244232.
The previous prime is 10233004244219. The next prime is 10233004244297. The reversal of 10233004244233 is 33244240033201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5547216694009 + 4685787550224 = 2355253^2 + 2164668^2 .
It is a cyclic number.
It is not a de Polignac number, because 10233004244233 - 25 = 10233004244201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10233004244195 and 10233004244204.
It is not a weakly prime, because it can be changed into another prime (10233004244213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116502122116 + 5116502122117.
It is an arithmetic number, because the mean of its divisors is an integer number (5116502122117).
Almost surely, 210233004244233 is an apocalyptic number.
It is an amenable number.
10233004244233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10233004244233 is an equidigital number, since it uses as much as digits as its factorization.
10233004244233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 10233004244233 its reverse (33244240033201), we get a palindrome (43477244277434).
The spelling of 10233004244233 in words is "ten trillion, two hundred thirty-three billion, four million, two hundred forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •