Base | Representation |
---|---|
bin | 100101001001011100111… |
… | …0101011000100101110111 |
3 | 200002002021210020010001010 |
4 | 1022102321311120211313 |
5 | 1132122120431130332 |
6 | 14505241402003303 |
7 | 1034602004560563 |
oct | 112227165304567 |
9 | 20062253203033 |
10 | 5105538926967 |
11 | 1699279694456 |
12 | 6a55a27a6533 |
13 | 2b05b129698b |
14 | 1391762b46a3 |
15 | 8cc17d699cc |
hex | 4a4b9d58977 |
5105538926967 has 4 divisors (see below), whose sum is σ = 6807385235960. Its totient is φ = 3403692617976.
The previous prime is 5105538926947. The next prime is 5105538927037. The reversal of 5105538926967 is 7696298355015.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5105538926967 - 234 = 5088359057783 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5105538926898 and 5105538926907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105538926947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850923154492 + ... + 850923154497.
It is an arithmetic number, because the mean of its divisors is an integer number (1701846308990).
Almost surely, 25105538926967 is an apocalyptic number.
5105538926967 is a deficient number, since it is larger than the sum of its proper divisors (1701846308993).
5105538926967 is a wasteful number, since it uses less digits than its factorization.
5105538926967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1701846308992.
The product of its (nonzero) digits is 122472000, while the sum is 66.
The spelling of 5105538926967 in words is "five trillion, one hundred five billion, five hundred thirty-eight million, nine hundred twenty-six thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •