Base | Representation |
---|---|
bin | 100001011110000… |
… | …0111000111000101 |
3 | 2220021020001111101 |
4 | 1002330013013011 |
5 | 4300000212041 |
6 | 303234540101 |
7 | 36554541655 |
oct | 10274070705 |
9 | 2807201441 |
10 | 1123054021 |
11 | 526a31121 |
12 | 274137631 |
13 | 14b89320b |
14 | a9220365 |
15 | 688dbb31 |
hex | 42f071c5 |
1123054021 has 2 divisors, whose sum is σ = 1123054022. Its totient is φ = 1123054020.
The previous prime is 1123054013. The next prime is 1123054027. The reversal of 1123054021 is 1204503211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1018503396 + 104550625 = 31914^2 + 10225^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123054021 - 23 = 1123054013 is a prime.
It is a super-2 number, since 2×11230540212 = 2522500668168536882, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1123054021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123054027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561527010 + 561527011.
It is an arithmetic number, because the mean of its divisors is an integer number (561527011).
Almost surely, 21123054021 is an apocalyptic number.
It is an amenable number.
1123054021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123054021 is an equidigital number, since it uses as much as digits as its factorization.
1123054021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1123054021 is about 33511.9981648364. The cubic root of 1123054021 is about 1039.4418914386.
Adding to 1123054021 its reverse (1204503211), we get a palindrome (2327557232).
The spelling of 1123054021 in words is "one billion, one hundred twenty-three million, fifty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •