Base | Representation |
---|---|
bin | 1001010101101110… |
… | …00110110010100101 |
3 | 110221102211102220112 |
4 | 10222313012302211 |
5 | 40232044243401 |
6 | 2145312342405 |
7 | 235152526235 |
oct | 45267066245 |
9 | 13842742815 |
10 | 5014056101 |
11 | 214333861a |
12 | b7b244a05 |
13 | 61ba40702 |
14 | 357cbdcc5 |
15 | 1e52d13bb |
hex | 12adc6ca5 |
5014056101 has 16 divisors (see below), whose sum is σ = 5164513200. Its totient is φ = 4866048000.
The previous prime is 5014056079. The next prime is 5014056119. The reversal of 5014056101 is 1016504105.
It is a Cunningham number, because it is equal to 708102+1.
It can be written as a sum of positive squares in 8 ways, for example, as 3052452001 + 1961604100 = 55249^2 + 44290^2 .
It is a cyclic number.
It is not a de Polignac number, because 5014056101 - 26 = 5014056037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5014056161) 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 15 ways as a sum of consecutive naturals, for example, 4174301 + ... + 4175501.
It is an arithmetic number, because the mean of its divisors is an integer number (322782075).
Almost surely, 25014056101 is an apocalyptic number.
It is an amenable number.
5014056101 is a deficient number, since it is larger than the sum of its proper divisors (150457099).
5014056101 is a wasteful number, since it uses less digits than its factorization.
5014056101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2120.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 5014056101 is about 70810.0000070611. Note that the first 5 decimals coincide. The cubic root of 5014056101 is about 1711.5768204506.
The spelling of 5014056101 in words is "five billion, fourteen million, fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •