Base | Representation |
---|---|
bin | 1000000001111100… |
… | …0000000101010101 |
3 | 12120020011100122012 |
4 | 2000133000011111 |
5 | 13403314013303 |
6 | 553522114005 |
7 | 104263246403 |
oct | 20037000525 |
9 | 5506140565 |
10 | 2155610453 |
11 | a06871047 |
12 | 501aab905 |
13 | 28478bb59 |
14 | 166404473 |
15 | c939e5d8 |
hex | 807c0155 |
2155610453 has 2 divisors, whose sum is σ = 2155610454. Its totient is φ = 2155610452.
The previous prime is 2155610423. The next prime is 2155610467. The reversal of 2155610453 is 3540165512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2155094929 + 515524 = 46423^2 + 718^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2155610453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2155610423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1077805226 + 1077805227.
It is an arithmetic number, because the mean of its divisors is an integer number (1077805227).
Almost surely, 22155610453 is an apocalyptic number.
It is an amenable number.
2155610453 is a deficient number, since it is larger than the sum of its proper divisors (1).
2155610453 is an equidigital number, since it uses as much as digits as its factorization.
2155610453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 2155610453 is about 46428.5521312048. The cubic root of 2155610453 is about 1291.7845727476.
Adding to 2155610453 its reverse (3540165512), we get a palindrome (5695775965).
The spelling of 2155610453 in words is "two billion, one hundred fifty-five million, six hundred ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •