Base | Representation |
---|---|
bin | 100111011101010100010… |
… | …0101001101101010110011 |
3 | 201012102220120020100210111 |
4 | 1032322220211031222303 |
5 | 1202322430211231110 |
6 | 15311154402042151 |
7 | 1066542622252264 |
oct | 116725045155263 |
9 | 21172816210714 |
10 | 5423077055155 |
11 | 1800a06688a71 |
12 | 737041649357 |
13 | 304517730616 |
14 | 14a69a77496b |
15 | 9610009ae8a |
hex | 4eea894dab3 |
5423077055155 has 8 divisors (see below), whose sum is σ = 6511965418512. Its totient is φ = 4335613009248.
The previous prime is 5423077055141. The next prime is 5423077055161. The reversal of 5423077055155 is 5515507703245.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5423077055155 is a prime.
It is a super-2 number, since 2×54230770551552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5423077055099 and 5423077055108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 356070984 + ... + 356086213.
It is an arithmetic number, because the mean of its divisors is an integer number (813995677314).
Almost surely, 25423077055155 is an apocalyptic number.
5423077055155 is a deficient number, since it is larger than the sum of its proper divisors (1088888363357).
5423077055155 is a wasteful number, since it uses less digits than its factorization.
5423077055155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712158725.
The product of its (nonzero) digits is 3675000, while the sum is 49.
The spelling of 5423077055155 in words is "five trillion, four hundred twenty-three billion, seventy-seven million, fifty-five thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •