Base | Representation |
---|---|
bin | 1111010001110010… |
… | …0010000001101101 |
3 | 101120210222111011101 |
4 | 3310130202001231 |
5 | 31344341320414 |
6 | 1514541123101 |
7 | 203425642252 |
oct | 36434420155 |
9 | 11523874141 |
10 | 4101120109 |
11 | 1814a80269 |
12 | 965559491 |
13 | 504867cb8 |
14 | 2ac957429 |
15 | 19009ba74 |
hex | f472206d |
4101120109 has 2 divisors, whose sum is σ = 4101120110. Its totient is φ = 4101120108.
The previous prime is 4101120091. The next prime is 4101120119. The reversal of 4101120109 is 9010211014.
Together with previous prime (4101120091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3998665225 + 102454884 = 63235^2 + 10122^2 .
It is a cyclic number.
It is not a de Polignac number, because 4101120109 - 29 = 4101119597 is a prime.
It is a super-2 number, since 2×41011201092 = 33638372296888343762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4101120119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2050560054 + 2050560055.
It is an arithmetic number, because the mean of its divisors is an integer number (2050560055).
Almost surely, 24101120109 is an apocalyptic number.
It is an amenable number.
4101120109 is a deficient number, since it is larger than the sum of its proper divisors (1).
4101120109 is an equidigital number, since it uses as much as digits as its factorization.
4101120109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 4101120109 is about 64039.9883588372. The cubic root of 4101120109 is about 1600.6664032625. Note that the first 3 decimals are identical.
The spelling of 4101120109 in words is "four billion, one hundred one million, one hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •