Base | Representation |
---|---|
bin | 100001011110000… |
… | …0010000000100001 |
3 | 2220021011222211022 |
4 | 1002330002000201 |
5 | 4244444024441 |
6 | 303234255225 |
7 | 36554424020 |
oct | 10274020041 |
9 | 2807158738 |
10 | 1123033121 |
11 | 526a17451 |
12 | 274127515 |
13 | 14b886852 |
14 | a92168b7 |
15 | 688d584b |
hex | 42f02021 |
1123033121 has 8 divisors (see below), whose sum is σ = 1339269504. Its totient is φ = 920747520.
The previous prime is 1123033097. The next prime is 1123033127. The reversal of 1123033121 is 1213303211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1123033121 - 218 = 1122770977 is a prime.
It is a super-2 number, since 2×11230331212 = 2522406781726001282, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1123033121.
It is not an unprimeable number, because it can be changed into a prime (1123033127) 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, 3487520 + ... + 3487841.
It is an arithmetic number, because the mean of its divisors is an integer number (167408688).
Almost surely, 21123033121 is an apocalyptic number.
It is an amenable number.
1123033121 is a deficient number, since it is larger than the sum of its proper divisors (216236383).
1123033121 is an equidigital number, since it uses as much as digits as its factorization.
1123033121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6975391.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1123033121 is about 33511.6863347698. The cubic root of 1123033121 is about 1039.4354434050.
Adding to 1123033121 its reverse (1213303211), we get a palindrome (2336336332).
The spelling of 1123033121 in words is "one billion, one hundred twenty-three million, thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •