Base | Representation |
---|---|
bin | 1000011001001100… |
… | …0001111001001001 |
3 | 12211000200010202111 |
4 | 2012103001321021 |
5 | 14103300313213 |
6 | 1011324302321 |
7 | 106556222653 |
oct | 20623017111 |
9 | 5730603674 |
10 | 2253135433 |
11 | a56921aaa |
12 | 52a6a19a1 |
13 | 29ba46c43 |
14 | 17534d6d3 |
15 | d2c15a3d |
hex | 864c1e49 |
2253135433 has 2 divisors, whose sum is σ = 2253135434. Its totient is φ = 2253135432.
The previous prime is 2253135419. The next prime is 2253135439. The reversal of 2253135433 is 3345313522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2247044409 + 6091024 = 47403^2 + 2468^2 .
It is a cyclic number.
It is not a de Polignac number, because 2253135433 - 213 = 2253127241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2253135395 and 2253135404.
It is not a weakly prime, because it can be changed into another prime (2253135439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1126567716 + 1126567717.
It is an arithmetic number, because the mean of its divisors is an integer number (1126567717).
Almost surely, 22253135433 is an apocalyptic number.
It is an amenable number.
2253135433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2253135433 is an equidigital number, since it uses as much as digits as its factorization.
2253135433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32400, while the sum is 31.
The square root of 2253135433 is about 47467.2037621767. The cubic root of 2253135433 is about 1310.9790930351.
Adding to 2253135433 its reverse (3345313522), we get a palindrome (5598448955).
The spelling of 2253135433 in words is "two billion, two hundred fifty-three million, one hundred thirty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •