Base | Representation |
---|---|
bin | 1001100000101011… |
… | …01000110111001101 |
3 | 111011211201221020101 |
4 | 10300111220313031 |
5 | 40424110233221 |
6 | 2202354051101 |
7 | 240346553056 |
oct | 46025506715 |
9 | 14154657211 |
10 | 5105946061 |
11 | 219019a937 |
12 | ba5b79a91 |
13 | 634aa4978 |
14 | 36619d72d |
15 | 1ed3d2d91 |
hex | 130568dcd |
5105946061 has 4 divisors (see below), whose sum is σ = 5112258300. Its totient is φ = 5099633824.
The previous prime is 5105946007. The next prime is 5105946067. The reversal of 5105946061 is 1606495015.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3398190436 + 1707755625 = 58294^2 + 41325^2 .
It is a cyclic number.
It is not a de Polignac number, because 5105946061 - 211 = 5105944013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5105946061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105946067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3154906 + ... + 3156523.
It is an arithmetic number, because the mean of its divisors is an integer number (1278064575).
Almost surely, 25105946061 is an apocalyptic number.
It is an amenable number.
5105946061 is a deficient number, since it is larger than the sum of its proper divisors (6312239).
5105946061 is an equidigital number, since it uses as much as digits as its factorization.
5105946061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6312238.
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 5105946061 is about 71455.9029122157. The cubic root of 5105946061 is about 1721.9693124543.
The spelling of 5105946061 in words is "five billion, one hundred five million, nine hundred forty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •