Base | Representation |
---|---|
bin | 1001100000111011… |
… | …11001100101101001 |
3 | 111011222210221222000 |
4 | 10300131321211221 |
5 | 40430134033341 |
6 | 2202512321213 |
7 | 240404142666 |
oct | 46035714551 |
9 | 14158727860 |
10 | 5108111721 |
11 | 2191439a39 |
12 | ba6843209 |
13 | 63538261b |
14 | 3665a4a6d |
15 | 1ed6ae8b6 |
hex | 130779969 |
5108111721 has 32 divisors (see below), whose sum is σ = 7635696000. Its totient is φ = 3374861760.
The previous prime is 5108111713. The next prime is 5108111761. The reversal of 5108111721 is 1271118015.
5108111721 is a `hidden beast` number, since 510 + 81 + 1 + 1 + 72 + 1 = 666.
It is not a de Polignac number, because 5108111721 - 23 = 5108111713 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5108111711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2175270 + ... + 2177616.
It is an arithmetic number, because the mean of its divisors is an integer number (238615500).
Almost surely, 25108111721 is an apocalyptic number.
It is an amenable number.
5108111721 is a deficient number, since it is larger than the sum of its proper divisors (2527584279).
5108111721 is a wasteful number, since it uses less digits than its factorization.
5108111721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3046 (or 3040 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 27.
The square root of 5108111721 is about 71471.0551272332. The cubic root of 5108111721 is about 1722.2127327660.
Adding to 5108111721 its reverse (1271118015), we get a palindrome (6379229736).
The spelling of 5108111721 in words is "five billion, one hundred eight million, one hundred eleven thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •