Base | Representation |
---|---|
bin | 111011110100110001010… |
… | …010000011110110001001 |
3 | 112120000111100201221122001 |
4 | 323310301102003312021 |
5 | 1014324023243121301 |
6 | 12424341302031001 |
7 | 603006102563566 |
oct | 73646122036611 |
9 | 15500440657561 |
10 | 4111110520201 |
11 | 134556a791a73 |
12 | 564916718461 |
13 | 23a8a33ba889 |
14 | 102d9bbdd86d |
15 | 71e15815c01 |
hex | 3bd31483d89 |
4111110520201 has 2 divisors, whose sum is σ = 4111110520202. Its totient is φ = 4111110520200.
The previous prime is 4111110520163. The next prime is 4111110520211. The reversal of 4111110520201 is 1020250111114.
4111110520201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3116654814025 + 994455706176 = 1765405^2 + 997224^2 .
It is a cyclic number.
It is not a de Polignac number, because 4111110520201 - 215 = 4111110487433 is a prime.
It is not a weakly prime, because it can be changed into another prime (4111110520211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2055555260100 + 2055555260101.
It is an arithmetic number, because the mean of its divisors is an integer number (2055555260101).
Almost surely, 24111110520201 is an apocalyptic number.
It is an amenable number.
4111110520201 is a deficient number, since it is larger than the sum of its proper divisors (1).
4111110520201 is an equidigital number, since it uses as much as digits as its factorization.
4111110520201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 4111110520201 its reverse (1020250111114), we get a palindrome (5131360631315).
The spelling of 4111110520201 in words is "four trillion, one hundred eleven billion, one hundred ten million, five hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •