Base | Representation |
---|---|
bin | 100001011101001… |
… | …1111001111001001 |
3 | 2220020102102212022 |
4 | 1002322133033021 |
5 | 4244343103203 |
6 | 303221454225 |
7 | 36551120354 |
oct | 10272371711 |
9 | 2806372768 |
10 | 1122628553 |
11 | 5267704a2 |
12 | 273b71375 |
13 | 14b774667 |
14 | a914d29b |
15 | 68855a38 |
hex | 42e9f3c9 |
1122628553 has 4 divisors (see below), whose sum is σ = 1130823060. Its totient is φ = 1114434048.
The previous prime is 1122628469. The next prime is 1122628561. The reversal of 1122628553 is 3558262211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 726140809 + 396487744 = 26947^2 + 19912^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122628553 - 218 = 1122366409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1122628153) 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 in 3 ways as a sum of consecutive naturals, for example, 4097048 + ... + 4097321.
It is an arithmetic number, because the mean of its divisors is an integer number (282705765).
Almost surely, 21122628553 is an apocalyptic number.
It is an amenable number.
1122628553 is a deficient number, since it is larger than the sum of its proper divisors (8194507).
1122628553 is an equidigital number, since it uses as much as digits as its factorization.
1122628553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8194506.
The product of its digits is 28800, while the sum is 35.
The square root of 1122628553 is about 33505.6495683937. The cubic root of 1122628553 is about 1039.3106109853.
The spelling of 1122628553 in words is "one billion, one hundred twenty-two million, six hundred twenty-eight thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •