Base | Representation |
---|---|
bin | 100000101100100101000… |
… | …001110101010111110001 |
3 | 21221210121120022022120112 |
4 | 200230211001311113301 |
5 | 243303112104233203 |
6 | 4440112343551105 |
7 | 321222002341241 |
oct | 40544501652761 |
9 | 7853546268515 |
10 | 2246889133553 |
11 | 79699a381029 |
12 | 30356675b495 |
13 | 133b5ac9218c |
14 | 7aa70079b21 |
15 | 3d6a7b536d8 |
hex | 20b250755f1 |
2246889133553 has 2 divisors, whose sum is σ = 2246889133554. Its totient is φ = 2246889133552.
The previous prime is 2246889133547. The next prime is 2246889133627. The reversal of 2246889133553 is 3553319886422.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2239952242609 + 6936890944 = 1496647^2 + 83288^2 .
It is a cyclic number.
It is not a de Polignac number, because 2246889133553 - 28 = 2246889133297 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2246889133492 and 2246889133501.
It is not a weakly prime, because it can be changed into another prime (2246889133453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1123444566776 + 1123444566777.
It is an arithmetic number, because the mean of its divisors is an integer number (1123444566777).
Almost surely, 22246889133553 is an apocalyptic number.
It is an amenable number.
2246889133553 is a deficient number, since it is larger than the sum of its proper divisors (1).
2246889133553 is an equidigital number, since it uses as much as digits as its factorization.
2246889133553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 37324800, while the sum is 59.
The spelling of 2246889133553 in words is "two trillion, two hundred forty-six billion, eight hundred eighty-nine million, one hundred thirty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •