Base | Representation |
---|---|
bin | 1001100111010000… |
… | …00101000000010001 |
3 | 111022200112122002100 |
4 | 10303220011000101 |
5 | 41032221032234 |
6 | 2212044311013 |
7 | 241616503335 |
oct | 46350050021 |
9 | 14280478070 |
10 | 5161111569 |
11 | 2209349569 |
12 | 1000542469 |
13 | 64334b293 |
14 | 36d63d7c5 |
15 | 20317d399 |
hex | 133a05011 |
5161111569 has 24 divisors (see below), whose sum is σ = 7857948800. Its totient is φ = 3255228000.
The previous prime is 5161111559. The next prime is 5161111577. The reversal of 5161111569 is 9651111615.
It is a happy number.
5161111569 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5161111569 - 27 = 5161111441 is a prime.
It is a super-2 number, since 2×51611115692 = 53274145255331283522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5161111559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 108327 + ... + 148515.
Almost surely, 25161111569 is an apocalyptic number.
It is an amenable number.
5161111569 is a deficient number, since it is larger than the sum of its proper divisors (2696837231).
5161111569 is a wasteful number, since it uses less digits than its factorization.
5161111569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40965 (or 40962 counting only the distinct ones).
The product of its digits is 8100, while the sum is 36.
The square root of 5161111569 is about 71840.8767276681. The cubic root of 5161111569 is about 1728.1485945149.
The spelling of 5161111569 in words is "five billion, one hundred sixty-one million, one hundred eleven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •