Base | Representation |
---|---|
bin | 100100111111011000110… |
… | …1010101100110000000111 |
3 | 200000000111121201010010001 |
4 | 1021332301222230300013 |
5 | 1131243340312244001 |
6 | 14451305052542131 |
7 | 1033205311046413 |
oct | 111766152546007 |
9 | 20000447633101 |
10 | 5083927071751 |
11 | 1690099326790 |
12 | 6a1370a81947 |
13 | 2ab548995178 |
14 | 1380c5ccdd43 |
15 | 8c3a085c001 |
hex | 49fb1aacc07 |
5083927071751 has 4 divisors (see below), whose sum is σ = 5546102260104. Its totient is φ = 4621751883400.
The previous prime is 5083927071697. The next prime is 5083927071757. The reversal of 5083927071751 is 1571707293805.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5083927071751 - 221 = 5083924974599 is a prime.
It is a super-3 number, since 3×50839270717513 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5083927071692 and 5083927071701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5083927071757) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231087594160 + ... + 231087594181.
It is an arithmetic number, because the mean of its divisors is an integer number (1386525565026).
Almost surely, 25083927071751 is an apocalyptic number.
5083927071751 is a deficient number, since it is larger than the sum of its proper divisors (462175188353).
5083927071751 is a wasteful number, since it uses less digits than its factorization.
5083927071751 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462175188352.
The product of its (nonzero) digits is 3704400, while the sum is 55.
The spelling of 5083927071751 in words is "five trillion, eighty-three billion, nine hundred twenty-seven million, seventy-one thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •