Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …0011101111111100100001 |
3 | 1110101020212201001010210001 |
4 | 2201312030003233330201 |
5 | 2424210344122404101 |
6 | 35353215134140001 |
7 | 2225353012126366 |
oct | 241661403577441 |
9 | 43336781033701 |
10 | 11122020122401 |
11 | 35a8905454981 |
12 | 12b7632051601 |
13 | 628a56cac806 |
14 | 2a6446cd446d |
15 | 144498b99901 |
hex | a1d8c0eff21 |
11122020122401 has 2 divisors, whose sum is σ = 11122020122402. Its totient is φ = 11122020122400.
The previous prime is 11122020122359. The next prime is 11122020122407. The reversal of 11122020122401 is 10422102022111.
11122020122401 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., 8898283034001 + 2223737088400 = 2982999^2 + 1491220^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122020122401 - 233 = 11113430187809 is a prime.
It is not a weakly prime, because it can be changed into another prime (11122020122407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561010061200 + 5561010061201.
It is an arithmetic number, because the mean of its divisors is an integer number (5561010061201).
Almost surely, 211122020122401 is an apocalyptic number.
It is an amenable number.
11122020122401 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122020122401 is an equidigital number, since it uses as much as digits as its factorization.
11122020122401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11122020122401 its reverse (10422102022111), we get a palindrome (21544122144512).
The spelling of 11122020122401 in words is "eleven trillion, one hundred twenty-two billion, twenty million, one hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •