Base | Representation |
---|---|
bin | 100101100101101001111… |
… | …1110110110001001001010 |
3 | 200021212121220000222221120 |
4 | 1023023103332312021022 |
5 | 1134120141413011231 |
6 | 14553135445220110 |
7 | 1042144644205032 |
oct | 113132376661112 |
9 | 20255556028846 |
10 | 5166107157066 |
11 | 1711a2a8a0169 |
12 | 6b5286a01636 |
13 | 2b6214677c9b |
14 | 13c0804008c2 |
15 | 8e5b0411d96 |
hex | 4b2d3fb624a |
5166107157066 has 16 divisors (see below), whose sum is σ = 10939991626944. Its totient is φ = 1620739500224.
The previous prime is 5166107157059. The next prime is 5166107157073. The reversal of 5166107157066 is 6607517016615.
It is an interprime number because it is at equal distance from previous prime (5166107157059) and next prime (5166107157073).
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
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, 25324054590 + ... + 25324054793.
It is an arithmetic number, because the mean of its divisors is an integer number (683749476684).
Almost surely, 25166107157066 is an apocalyptic number.
5166107157066 is an abundant number, since it is smaller than the sum of its proper divisors (5773884469878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5166107157066 is a wasteful number, since it uses less digits than its factorization.
5166107157066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50648109405.
The product of its (nonzero) digits is 1587600, while the sum is 51.
The spelling of 5166107157066 in words is "five trillion, one hundred sixty-six billion, one hundred seven million, one hundred fifty-seven thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •