Base | Representation |
---|---|
bin | 1001011011011000… |
… | …11111101100000111 |
3 | 111001202022020022111 |
4 | 10231230133230013 |
5 | 40331232344101 |
6 | 2154131441451 |
7 | 236300641150 |
oct | 45554375407 |
9 | 14052266274 |
10 | 5061606151 |
11 | 2168165688 |
12 | b93156287 |
13 | 62884b934 |
14 | 36033a927 |
15 | 1e9575251 |
hex | 12db1fb07 |
5061606151 has 8 divisors (see below), whose sum is σ = 5785723424. Its totient is φ = 4337746560.
The previous prime is 5061606107. The next prime is 5061606161. The reversal of 5061606151 is 1516061605.
5061606151 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5061606151 - 227 = 4927388423 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5061606161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20310 + ... + 102643.
It is an arithmetic number, because the mean of its divisors is an integer number (723215428).
Almost surely, 25061606151 is an apocalyptic number.
5061606151 is a deficient number, since it is larger than the sum of its proper divisors (724117273).
5061606151 is a wasteful number, since it uses less digits than its factorization.
5061606151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128841.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 5061606151 is about 71144.9657460034. The cubic root of 5061606151 is about 1716.9703009256.
Adding to 5061606151 its reverse (1516061605), we get a palindrome (6577667756).
The spelling of 5061606151 in words is "five billion, sixty-one million, six hundred six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •