Base | Representation |
---|---|
bin | 1000000001101101… |
… | …1001010111101101 |
3 | 12120011101100100012 |
4 | 2000123121113231 |
5 | 13403043243303 |
6 | 553445543005 |
7 | 104252232323 |
oct | 20033312755 |
9 | 5504340305 |
10 | 2154665453 |
11 | a06286056 |
12 | 501714a65 |
13 | 28451a995 |
14 | 166239d13 |
15 | c92645d8 |
hex | 806d95ed |
2154665453 has 2 divisors, whose sum is σ = 2154665454. Its totient is φ = 2154665452.
The previous prime is 2154665419. The next prime is 2154665483. The reversal of 2154665453 is 3545664512.
It is a happy number.
2154665453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1690607689 + 464057764 = 41117^2 + 21542^2 .
It is a cyclic number.
It is not a de Polignac number, because 2154665453 - 26 = 2154665389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2154665453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2154665483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1077332726 + 1077332727.
It is an arithmetic number, because the mean of its divisors is an integer number (1077332727).
Almost surely, 22154665453 is an apocalyptic number.
It is an amenable number.
2154665453 is a deficient number, since it is larger than the sum of its proper divisors (1).
2154665453 is an equidigital number, since it uses as much as digits as its factorization.
2154665453 is an evil number, because the sum of its binary digits is even.
The product of its digits is 432000, while the sum is 41.
The square root of 2154665453 is about 46418.3740882853. The cubic root of 2154665453 is about 1291.5957762902.
The spelling of 2154665453 in words is "two billion, one hundred fifty-four million, six hundred sixty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •