Base | Representation |
---|---|
bin | 100001011110000… |
… | …0110101110011001 |
3 | 2220021012222022212 |
4 | 1002330012232121 |
5 | 4300000134231 |
6 | 303234524505 |
7 | 36554534240 |
oct | 10274065631 |
9 | 2807188285 |
10 | 1123052441 |
11 | 526a2aa15 |
12 | 274136735 |
13 | 14b892594 |
14 | a921d957 |
15 | 688db42b |
hex | 42f06b99 |
1123052441 has 8 divisors (see below), whose sum is σ = 1339292544. Its totient is φ = 920763360.
The previous prime is 1123052429. The next prime is 1123052449. The reversal of 1123052441 is 1442503211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123052441 - 26 = 1123052377 is a prime.
It is a super-2 number, since 2×11230524412 = 2522493570472116962, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123052449) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3487580 + ... + 3487901.
It is an arithmetic number, because the mean of its divisors is an integer number (167411568).
Almost surely, 21123052441 is an apocalyptic number.
It is an amenable number.
1123052441 is a deficient number, since it is larger than the sum of its proper divisors (216240103).
1123052441 is an equidigital number, since it uses as much as digits as its factorization.
1123052441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6975511.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 1123052441 is about 33511.9745911816. The cubic root of 1123052441 is about 1039.4414039824.
Adding to 1123052441 its reverse (1442503211), we get a palindrome (2565555652).
The spelling of 1123052441 in words is "one billion, one hundred twenty-three million, fifty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •