Base | Representation |
---|---|
bin | 100101011000100001011… |
… | …0100000000010001001001 |
3 | 200012011211012201011020112 |
4 | 1022301002310000101021 |
5 | 1133134410331033412 |
6 | 14532153003004105 |
7 | 1040125665563450 |
oct | 112610264002111 |
9 | 20164735634215 |
10 | 5137901814857 |
11 | 1700a766a2099 |
12 | 6ab914b09635 |
13 | 2b366b052496 |
14 | 13a96647bb97 |
15 | 8d9ae138722 |
hex | 4ac42d00449 |
5137901814857 has 8 divisors (see below), whose sum is σ = 6217292952576. Its totient is φ = 4144861968192.
The previous prime is 5137901814847. The next prime is 5137901814883. The reversal of 5137901814857 is 7584181097315.
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 5137901814857 - 24 = 5137901814841 is a prime.
It is a super-2 number, since 2×51379018148572 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5137901814796 and 5137901814805.
It is not an unprimeable number, because it can be changed into a prime (5137901814817) 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, 21587822633 + ... + 21587822870.
It is an arithmetic number, because the mean of its divisors is an integer number (777161619072).
Almost surely, 25137901814857 is an apocalyptic number.
It is an amenable number.
5137901814857 is a deficient number, since it is larger than the sum of its proper divisors (1079391137719).
5137901814857 is a wasteful number, since it uses less digits than its factorization.
5137901814857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43175645527.
The product of its (nonzero) digits is 8467200, while the sum is 59.
The spelling of 5137901814857 in words is "five trillion, one hundred thirty-seven billion, nine hundred one million, eight hundred fourteen thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •