Base | Representation |
---|---|
bin | 111011111100000… |
… | …1101100101010001 |
3 | 12012011110210012122 |
4 | 1313320031211101 |
5 | 13104333140101 |
6 | 531323304025 |
7 | 100561060664 |
oct | 16770154521 |
9 | 5164423178 |
10 | 2011224401 |
11 | 94231372a |
12 | 48167b015 |
13 | 2608a7314 |
14 | 15117b6db |
15 | bb87d51b |
hex | 77e0d951 |
2011224401 has 2 divisors, whose sum is σ = 2011224402. Its totient is φ = 2011224400.
The previous prime is 2011224367. The next prime is 2011224421. The reversal of 2011224401 is 1044221102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1648360000 + 362864401 = 40600^2 + 19049^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011224401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011224401.
It is not a weakly prime, because it can be changed into another prime (2011224421) 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 as a sum of consecutive naturals, namely, 1005612200 + 1005612201.
It is an arithmetic number, because the mean of its divisors is an integer number (1005612201).
Almost surely, 22011224401 is an apocalyptic number.
It is an amenable number.
2011224401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011224401 is an equidigital number, since it uses as much as digits as its factorization.
2011224401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 2011224401 is about 44846.6765881263. The cubic root of 2011224401 is about 1262.2736308317.
Adding to 2011224401 its reverse (1044221102), we get a palindrome (3055445503).
The spelling of 2011224401 in words is "two billion, eleven million, two hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •