Base | Representation |
---|---|
bin | 100001100100100… |
… | …0010100110001001 |
3 | 2220111121020211222 |
4 | 1003021002212021 |
5 | 4301332142101 |
6 | 303435331425 |
7 | 36625416356 |
oct | 10311024611 |
9 | 2814536758 |
10 | 1126443401 |
11 | 528936666 |
12 | 2752b0b75 |
13 | 14c4abb75 |
14 | a986362d |
15 | 68d5b01b |
hex | 43242989 |
1126443401 has 2 divisors, whose sum is σ = 1126443402. Its totient is φ = 1126443400.
The previous prime is 1126443379. The next prime is 1126443403. The reversal of 1126443401 is 1043446211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1115560000 + 10883401 = 33400^2 + 3299^2 .
It is a cyclic number.
It is not a de Polignac number, because 1126443401 - 26 = 1126443337 is a prime.
Together with 1126443403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1126443403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 563221700 + 563221701.
It is an arithmetic number, because the mean of its divisors is an integer number (563221701).
Almost surely, 21126443401 is an apocalyptic number.
It is an amenable number.
1126443401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1126443401 is an equidigital number, since it uses as much as digits as its factorization.
1126443401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 1126443401 is about 33562.5297169328. The cubic root of 1126443401 is about 1040.4865207019.
Adding to 1126443401 its reverse (1043446211), we get a palindrome (2169889612).
The spelling of 1126443401 in words is "one billion, one hundred twenty-six million, four hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •