Base | Representation |
---|---|
bin | 100100011111000000001… |
… | …1000000111101101110001 |
3 | 122202100222210211101110121 |
4 | 1020332000120013231301 |
5 | 1124123422421004022 |
6 | 14355324043330241 |
7 | 1025164012123450 |
oct | 110760030075561 |
9 | 18670883741417 |
10 | 5014380641137 |
11 | 166365016904a |
12 | 68b9a1b20981 |
13 | 2a4b144c708a |
14 | 1349a9624b97 |
15 | 8a67ee922c7 |
hex | 48f80607b71 |
5014380641137 has 64 divisors (see below), whose sum is σ = 5990345077248. Its totient is φ = 4108465152000.
The previous prime is 5014380641089. The next prime is 5014380641141. The reversal of 5014380641137 is 7311460834105.
It is a cyclic number.
It is not a de Polignac number, because 5014380641137 - 211 = 5014380639089 is a prime.
It is a super-2 number, since 2×50143806411372 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5014380641093 and 5014380641102.
It is not an unprimeable number, because it can be changed into a prime (5014380641177) 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 63 ways as a sum of consecutive naturals, for example, 2198324437 + ... + 2198326717.
It is an arithmetic number, because the mean of its divisors is an integer number (93599141832).
Almost surely, 25014380641137 is an apocalyptic number.
It is an amenable number.
5014380641137 is a deficient number, since it is larger than the sum of its proper divisors (975964436111).
5014380641137 is a wasteful number, since it uses less digits than its factorization.
5014380641137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3050.
The product of its (nonzero) digits is 241920, while the sum is 43.
The spelling of 5014380641137 in words is "five trillion, fourteen billion, three hundred eighty million, six hundred forty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •