Base | Representation |
---|---|
bin | 100100110111000111001… |
… | …1001100010011111101001 |
3 | 122221022122002100210212010 |
4 | 1021232032121202133221 |
5 | 1131000441302022140 |
6 | 14435205410310133 |
7 | 1032006025150365 |
oct | 111561631423751 |
9 | 18838562323763 |
10 | 5066155501545 |
11 | 16835a9784a86 |
12 | 699a31288349 |
13 | 2a9975b94258 |
14 | 1372bb9662a5 |
15 | 8bbb0576880 |
hex | 49b8e6627e9 |
5066155501545 has 8 divisors (see below), whose sum is σ = 8105848802496. Its totient is φ = 2701949600816.
The previous prime is 5066155501501. The next prime is 5066155501549. The reversal of 5066155501545 is 5451055516605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5066155501545 - 26 = 5066155501481 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5066155501494 and 5066155501503.
It is not an unprimeable number, because it can be changed into a prime (5066155501549) by changing a digit.
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, 168871850037 + ... + 168871850066.
It is an arithmetic number, because the mean of its divisors is an integer number (1013231100312).
Almost surely, 25066155501545 is an apocalyptic number.
It is an amenable number.
5066155501545 is a deficient number, since it is larger than the sum of its proper divisors (3039693300951).
5066155501545 is a wasteful number, since it uses less digits than its factorization.
5066155501545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337743700111.
The product of its (nonzero) digits is 2250000, while the sum is 48.
The spelling of 5066155501545 in words is "five trillion, sixty-six billion, one hundred fifty-five million, five hundred one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •