Base | Representation |
---|---|
bin | 100101011110001101110… |
… | …1111000100100011001001 |
3 | 200020100101111021211022211 |
4 | 1022330123233010203021 |
5 | 1133334432031042022 |
6 | 14541534303145121 |
7 | 1041041023105414 |
oct | 112743357044311 |
9 | 20210344254284 |
10 | 5150131112137 |
11 | 1706181827150 |
12 | 6b21685a51a1 |
13 | 2b486985b46b |
14 | 13b3a6706b7b |
15 | 8de77a9de77 |
hex | 4af1bbc48c9 |
5150131112137 has 8 divisors (see below), whose sum is σ = 5619533407200. Its totient is φ = 4680930243360.
The previous prime is 5150131112117. The next prime is 5150131112149. The reversal of 5150131112137 is 7312111310515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5150131112137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5150131112099 and 5150131112108.
It is not an unprimeable number, because it can be changed into a prime (5150131112117) 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, 50303103 + ... + 50405380.
It is an arithmetic number, because the mean of its divisors is an integer number (702441675900).
Almost surely, 25150131112137 is an apocalyptic number.
It is an amenable number.
5150131112137 is a deficient number, since it is larger than the sum of its proper divisors (469402295063).
5150131112137 is a wasteful number, since it uses less digits than its factorization.
5150131112137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100713143.
The product of its (nonzero) digits is 3150, while the sum is 31.
The spelling of 5150131112137 in words is "five trillion, one hundred fifty billion, one hundred thirty-one million, one hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •