Base | Representation |
---|---|
bin | 100111101011111100111… |
… | …1011100010111110101101 |
3 | 201022110000221112110021222 |
4 | 1033113321323202332231 |
5 | 1203331312144311211 |
6 | 15333433223033125 |
7 | 1102034521263032 |
oct | 117277173427655 |
9 | 21273027473258 |
10 | 5454506635181 |
11 | 181327488469a |
12 | 74115329b7a5 |
13 | 30748602cc56 |
14 | 14bddc9d1389 |
15 | 96d3e45e1db |
hex | 4f5f9ee2fad |
5454506635181 has 2 divisors, whose sum is σ = 5454506635182. Its totient is φ = 5454506635180.
The previous prime is 5454506635133. The next prime is 5454506635243. The reversal of 5454506635181 is 1815366054545.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5231123737225 + 223382897956 = 2287165^2 + 472634^2 .
It is a cyclic number.
It is not a de Polignac number, because 5454506635181 - 230 = 5453432893357 is a prime.
It is a super-2 number, since 2×54545066351812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5454506635681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2727253317590 + 2727253317591.
It is an arithmetic number, because the mean of its divisors is an integer number (2727253317591).
Almost surely, 25454506635181 is an apocalyptic number.
It is an amenable number.
5454506635181 is a deficient number, since it is larger than the sum of its proper divisors (1).
5454506635181 is an equidigital number, since it uses as much as digits as its factorization.
5454506635181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640000, while the sum is 53.
The spelling of 5454506635181 in words is "five trillion, four hundred fifty-four billion, five hundred six million, six hundred thirty-five thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •