Base | Representation |
---|---|
bin | 100001011011100… |
… | …1111101011100001 |
3 | 2220011211020200012 |
4 | 1002313033223201 |
5 | 4244133402101 |
6 | 303151334305 |
7 | 36540646652 |
oct | 10267175341 |
9 | 2804736605 |
10 | 1121778401 |
11 | 52623a797 |
12 | 273821395 |
13 | 14b537703 |
14 | a8dab529 |
15 | 68738bbb |
hex | 42dcfae1 |
1121778401 has 2 divisors, whose sum is σ = 1121778402. Its totient is φ = 1121778400.
The previous prime is 1121778347. The next prime is 1121778407. The reversal of 1121778401 is 1048771211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 728946001 + 392832400 = 26999^2 + 19820^2 .
It is an emirp because it is prime and its reverse (1048771211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121778401 is a prime.
It is a super-3 number, since 3×11217784013 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1121778407) 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, 560889200 + 560889201.
It is an arithmetic number, because the mean of its divisors is an integer number (560889201).
Almost surely, 21121778401 is an apocalyptic number.
It is an amenable number.
1121778401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121778401 is an equidigital number, since it uses as much as digits as its factorization.
1121778401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3136, while the sum is 32.
The square root of 1121778401 is about 33492.9604693285. The cubic root of 1121778401 is about 1039.0481925967.
The spelling of 1121778401 in words is "one billion, one hundred twenty-one million, seven hundred seventy-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •