Base | Representation |
---|---|
bin | 100100110100011110101… |
… | …0101110100100001100101 |
3 | 122220210000222200022011102 |
4 | 1021220331111310201211 |
5 | 1130402401123330104 |
6 | 14432432322245445 |
7 | 1031415631263542 |
oct | 111507525644145 |
9 | 18823028608142 |
10 | 5060500605029 |
11 | 1681167734591 |
12 | 6989134b6885 |
13 | 2a9284458a3c |
14 | 136d0290bbc9 |
15 | 8b97ddaba1e |
hex | 49a3d574865 |
5060500605029 has 4 divisors (see below), whose sum is σ = 5066079989184. Its totient is φ = 5054921220876.
The previous prime is 5060500605011. The next prime is 5060500605037. The reversal of 5060500605029 is 9205060050605.
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 a de Polignac number, because none of the positive numbers 2k-5060500605029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5060500604983 and 5060500605001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5060500602029) 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, 2789690717 + ... + 2789692530.
It is an arithmetic number, because the mean of its divisors is an integer number (1266519997296).
Almost surely, 25060500605029 is an apocalyptic number.
It is an amenable number.
5060500605029 is a deficient number, since it is larger than the sum of its proper divisors (5579384155).
5060500605029 is an equidigital number, since it uses as much as digits as its factorization.
5060500605029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5579384154.
The product of its (nonzero) digits is 81000, while the sum is 38.
The spelling of 5060500605029 in words is "five trillion, sixty billion, five hundred million, six hundred five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •