Base | Representation |
---|---|
bin | 110011110001110010101101… |
… | …0111111000111111001001101 |
3 | 2012201121000222010202200220222 |
4 | 1213203211122333013321031 |
5 | 434143444111301010411 |
6 | 4252352053344321125 |
7 | 164634516462014255 |
oct | 14743453277077115 |
9 | 2181530863680828 |
10 | 455444153531981 |
11 | 12213386529a739 |
12 | 430b81656131a5 |
13 | 167192790b19b3 |
14 | 8067886846965 |
15 | 379c2333414db |
hex | 19e395afc7e4d |
455444153531981 has 2 divisors, whose sum is σ = 455444153531982. Its totient is φ = 455444153531980.
The previous prime is 455444153531929. The next prime is 455444153532023. The reversal of 455444153531981 is 189135351444554.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 424494569866756 + 30949583665225 = 20603266^2 + 5563235^2 .
It is a cyclic number.
It is not a de Polignac number, because 455444153531981 - 218 = 455444153269837 is a prime.
It is a super-2 number, since 2×4554441535319812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (455444153531911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 227722076765990 + 227722076765991.
It is an arithmetic number, because the mean of its divisors is an integer number (227722076765991).
Almost surely, 2455444153531981 is an apocalyptic number.
It is an amenable number.
455444153531981 is a deficient number, since it is larger than the sum of its proper divisors (1).
455444153531981 is an equidigital number, since it uses as much as digits as its factorization.
455444153531981 is an evil number, because the sum of its binary digits is even.
The product of its digits is 103680000, while the sum is 62.
The spelling of 455444153531981 in words is "four hundred fifty-five trillion, four hundred forty-four billion, one hundred fifty-three million, five hundred thirty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •