Base | Representation |
---|---|
bin | 100101001001011111111… |
… | …0111101000100011000011 |
3 | 200002002112211202021222000 |
4 | 1022102333313220203003 |
5 | 1132122322341224112 |
6 | 14505255420115043 |
7 | 1034604344321631 |
oct | 112227767504303 |
9 | 20062484667860 |
10 | 5105640179907 |
11 | 1699320861273 |
12 | 6a5610695a83 |
13 | 2b05c9258867 |
14 | 139185910351 |
15 | 8cc21bba7dc |
hex | 4a4bfde88c3 |
5105640179907 has 64 divisors (see below), whose sum is σ = 7650872371200. Its totient is φ = 3364883907840.
The previous prime is 5105640179903. The next prime is 5105640179911. The reversal of 5105640179907 is 7099710465015.
5105640179907 is a `hidden beast` number, since 5 + 1 + 0 + 564 + 0 + 1 + 79 + 9 + 0 + 7 = 666.
It is an interprime number because it is at equal distance from previous prime (5105640179903) and next prime (5105640179911).
It is not a de Polignac number, because 5105640179907 - 22 = 5105640179903 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5105640179903) 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 63 ways as a sum of consecutive naturals, for example, 1149657807 + ... + 1149662247.
It is an arithmetic number, because the mean of its divisors is an integer number (119544880800).
Almost surely, 25105640179907 is an apocalyptic number.
5105640179907 is a deficient number, since it is larger than the sum of its proper divisors (2545232191293).
5105640179907 is a wasteful number, since it uses less digits than its factorization.
5105640179907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5945 (or 5939 counting only the distinct ones).
The product of its (nonzero) digits is 2381400, while the sum is 54.
The spelling of 5105640179907 in words is "five trillion, one hundred five billion, six hundred forty million, one hundred seventy-nine thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •