Base | Representation |
---|---|
bin | 100100101101000100110… |
… | …1001010001011011011101 |
3 | 122212020222220120202211220 |
4 | 1021122021221101123131 |
5 | 1130122320312402024 |
6 | 14421242504403553 |
7 | 1030313625120345 |
oct | 111321151213335 |
9 | 18766886522756 |
10 | 5044600903389 |
11 | 16754487743a3 |
12 | 6958167765b9 |
13 | 2a791c3bc068 |
14 | 136235007d25 |
15 | 8b34d0c8e79 |
hex | 49689a516dd |
5044600903389 has 8 divisors (see below), whose sum is σ = 6726170788320. Its totient is φ = 3363049143696.
The previous prime is 5044600903367. The next prime is 5044600903411. The reversal of 5044600903389 is 9833090064405.
It is an interprime number because it is at equal distance from previous prime (5044600903367) and next prime (5044600903411).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5044600903389 - 213 = 5044600895197 is a prime.
It is a super-2 number, since 2×50446009033892 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5044600903339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3868027 + ... + 5005080.
It is an arithmetic number, because the mean of its divisors is an integer number (840771348540).
Almost surely, 25044600903389 is an apocalyptic number.
It is an amenable number.
5044600903389 is a deficient number, since it is larger than the sum of its proper divisors (1681569884931).
5044600903389 is a wasteful number, since it uses less digits than its factorization.
5044600903389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9062619.
The product of its (nonzero) digits is 2799360, while the sum is 51.
The spelling of 5044600903389 in words is "five trillion, forty-four billion, six hundred million, nine hundred three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •