Base | Representation |
---|---|
bin | 100101000000000100101… |
… | …0001001111011100001001 |
3 | 200000011022001020200202222 |
4 | 1022000021101033130021 |
5 | 1131304343034334342 |
6 | 14452110554103425 |
7 | 1033256605345325 |
oct | 112001121173411 |
9 | 20004261220688 |
10 | 5085396793097 |
11 | 1690782a06125 |
12 | 6a170111ab75 |
13 | 2ab72131567a |
14 | 1381c5190985 |
15 | 8c4398c4ed2 |
hex | 4a00944f709 |
5085396793097 has 8 divisors (see below), whose sum is σ = 5134911322944. Its totient is φ = 5035884989328.
The previous prime is 5085396793051. The next prime is 5085396793153. The reversal of 5085396793097 is 7903976935805.
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 5085396793097 - 26 = 5085396793033 is a prime.
It is a super-2 number, since 2×50853967930972 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5085396793097.
It is not an unprimeable number, because it can be changed into a prime (5085396793597) 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, 3173183 + ... + 4498875.
It is an arithmetic number, because the mean of its divisors is an integer number (641863915368).
Almost surely, 25085396793097 is an apocalyptic number.
It is an amenable number.
5085396793097 is a deficient number, since it is larger than the sum of its proper divisors (49514529847).
5085396793097 is a wasteful number, since it uses less digits than its factorization.
5085396793097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1363039.
The product of its (nonzero) digits is 385786800, while the sum is 71.
The spelling of 5085396793097 in words is "five trillion, eighty-five billion, three hundred ninety-six million, seven hundred ninety-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •