Base | Representation |
---|---|
bin | 100100010111111001000… |
… | …1011010100110000000101 |
3 | 122200220120120110110111201 |
4 | 1020233302023110300011 |
5 | 1123401134131120401 |
6 | 14344320501102501 |
7 | 1024113415025431 |
oct | 110576213246005 |
9 | 18626516413451 |
10 | 4999110020101 |
11 | 165812430948a |
12 | 688a3b9b7a31 |
13 | 2a354c898642 |
14 | 133d5b4b79c1 |
15 | 8a089523b01 |
hex | 48bf22d4c05 |
4999110020101 has 2 divisors, whose sum is σ = 4999110020102. Its totient is φ = 4999110020100.
The previous prime is 4999110020039. The next prime is 4999110020131. The reversal of 4999110020101 is 1010200119994.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4675065596100 + 324044424001 = 2162190^2 + 569249^2 .
It is a cyclic number.
It is not a de Polignac number, because 4999110020101 - 229 = 4998573149189 is a prime.
It is a super-2 number, since 2×49991100201012 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4999110020131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2499555010050 + 2499555010051.
It is an arithmetic number, because the mean of its divisors is an integer number (2499555010051).
Almost surely, 24999110020101 is an apocalyptic number.
It is an amenable number.
4999110020101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4999110020101 is an equidigital number, since it uses as much as digits as its factorization.
4999110020101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 37.
The spelling of 4999110020101 in words is "four trillion, nine hundred ninety-nine billion, one hundred ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •