Base | Representation |
---|---|
bin | 100101000010011111100… |
… | …1000110000101001001111 |
3 | 200000122201100112201020201 |
4 | 1022010333020300221033 |
5 | 1131401014422204032 |
6 | 14454330504354331 |
7 | 1033532462602051 |
oct | 112047710605117 |
9 | 20018640481221 |
10 | 5090595506767 |
11 | 1692a004a7701 |
12 | 6a27121759a7 |
13 | 2ac06c39abc4 |
14 | 1385597bb8d1 |
15 | 8c640ece8e7 |
hex | 4a13f230a4f |
5090595506767 has 8 divisors (see below), whose sum is σ = 5135982017760. Its totient is φ = 5045214908160.
The previous prime is 5090595506707. The next prime is 5090595506791. The reversal of 5090595506767 is 7676055950905.
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-5090595506767 is a prime.
It is a super-2 number, since 2×50905955067672 (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 = 5090595506699 and 5090595506708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5090595506707) 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, 260667 + ... + 3201427.
It is an arithmetic number, because the mean of its divisors is an integer number (641997752220).
Almost surely, 25090595506767 is an apocalyptic number.
5090595506767 is a deficient number, since it is larger than the sum of its proper divisors (45386510993).
5090595506767 is a wasteful number, since it uses less digits than its factorization.
5090595506767 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2956193.
The product of its (nonzero) digits is 89302500, while the sum is 64.
The spelling of 5090595506767 in words is "five trillion, ninety billion, five hundred ninety-five million, five hundred six thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •