Base | Representation |
---|---|
bin | 1001010110000010… |
… | …01101111000000001 |
3 | 110221121211002122201 |
4 | 10223001031320001 |
5 | 40233234102221 |
6 | 2145445233201 |
7 | 235214205436 |
oct | 45301157001 |
9 | 13847732581 |
10 | 5016706561 |
11 | 2144888989 |
12 | b80102801 |
13 | 61c45ac29 |
14 | 3583adb8d |
15 | 1e5656891 |
hex | 12b04de01 |
5016706561 has 4 divisors (see below), whose sum is σ = 5021536000. Its totient is φ = 5011877124.
The previous prime is 5016706559. The next prime is 5016706601. The reversal of 5016706561 is 1656076105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5016706561 - 21 = 5016706559 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 5016706561.
It is not an unprimeable number, because it can be changed into a prime (5016706661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2413161 + ... + 2415238.
It is an arithmetic number, because the mean of its divisors is an integer number (1255384000).
Almost surely, 25016706561 is an apocalyptic number.
It is an amenable number.
5016706561 is a deficient number, since it is larger than the sum of its proper divisors (4829439).
5016706561 is a wasteful number, since it uses less digits than its factorization.
5016706561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4829438.
The product of its (nonzero) digits is 37800, while the sum is 37.
The square root of 5016706561 is about 70828.7128289086. The cubic root of 5016706561 is about 1711.8783505697.
The spelling of 5016706561 in words is "five billion, sixteen million, seven hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •