Base | Representation |
---|---|
bin | 100100011010001101111… |
… | …1010100100010010000101 |
3 | 122201101110200211210202121 |
4 | 1020310123322210102011 |
5 | 1123441401420101022 |
6 | 14350504302005541 |
7 | 1024351251464032 |
oct | 110643372442205 |
9 | 18641420753677 |
10 | 5004105237637 |
11 | 165a257a4a340 |
12 | 6899b48768b1 |
13 | 2a3b6774146c |
14 | 1342b2a92389 |
15 | 8a27cd332c7 |
hex | 48d1bea4485 |
5004105237637 has 8 divisors (see below), whose sum is σ = 5484896049312. Its totient is φ = 4527626451600.
The previous prime is 5004105237601. The next prime is 5004105237661. The reversal of 5004105237637 is 7367325014005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5004105237637 - 211 = 5004105235589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5004105237593 and 5004105237602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5004105237037) 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, 1078003978 + ... + 1078008619.
It is an arithmetic number, because the mean of its divisors is an integer number (685612006164).
Almost surely, 25004105237637 is an apocalyptic number.
It is an amenable number.
5004105237637 is a deficient number, since it is larger than the sum of its proper divisors (480790811675).
5004105237637 is a wasteful number, since it uses less digits than its factorization.
5004105237637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2156012819.
The product of its (nonzero) digits is 529200, while the sum is 43.
The spelling of 5004105237637 in words is "five trillion, four billion, one hundred five million, two hundred thirty-seven thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •