Base | Representation |
---|---|
bin | 1001011110101010100000… |
… | …0100000101101110110001 |
3 | 1100220101001200202001011111 |
4 | 2113222220010011232301 |
5 | 2331230044014220213 |
6 | 34055553355513321 |
7 | 2123665020603661 |
oct | 227525004055661 |
9 | 40811050661144 |
10 | 10422410304433 |
11 | 33591349a5876 |
12 | 1203b24158841 |
13 | 5a7aa162741a |
14 | 28063975a1a1 |
15 | 13119deb6a3d |
hex | 97aa8105bb1 |
10422410304433 has 2 divisors, whose sum is σ = 10422410304434. Its totient is φ = 10422410304432.
The previous prime is 10422410304311. The next prime is 10422410304463. The reversal of 10422410304433 is 33440301422401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9297913365504 + 1124496938929 = 3049248^2 + 1060423^2 .
It is a cyclic number.
It is not a de Polignac number, because 10422410304433 - 213 = 10422410296241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10422410304395 and 10422410304404.
It is not a weakly prime, because it can be changed into another prime (10422410304463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5211205152216 + 5211205152217.
It is an arithmetic number, because the mean of its divisors is an integer number (5211205152217).
Almost surely, 210422410304433 is an apocalyptic number.
It is an amenable number.
10422410304433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10422410304433 is an equidigital number, since it uses as much as digits as its factorization.
10422410304433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 10422410304433 its reverse (33440301422401), we get a palindrome (43862711726834).
The spelling of 10422410304433 in words is "ten trillion, four hundred twenty-two billion, four hundred ten million, three hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •