Base | Representation |
---|---|
bin | 100001011010001… |
… | …0001101110000011 |
3 | 2220010100201100111 |
4 | 1002310101232003 |
5 | 4243434002243 |
6 | 303122532151 |
7 | 36531226342 |
oct | 10264215603 |
9 | 2803321314 |
10 | 1121000323 |
11 | 525859153 |
12 | 273507057 |
13 | 14b324501 |
14 | a8c47b59 |
15 | 6863339d |
hex | 42d11b83 |
1121000323 has 8 divisors (see below), whose sum is σ = 1180811520. Its totient is φ = 1061270280.
The previous prime is 1121000299. The next prime is 1121000401. The reversal of 1121000323 is 3230001211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121000323 is a prime.
It is a super-2 number, since 2×11210003232 = 2513283448332208658, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121000623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9186 + ... + 48232.
It is an arithmetic number, because the mean of its divisors is an integer number (147601440).
Almost surely, 21121000323 is an apocalyptic number.
1121000323 is a deficient number, since it is larger than the sum of its proper divisors (59811197).
1121000323 is a wasteful number, since it uses less digits than its factorization.
1121000323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40577.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1121000323 is about 33481.3429091487. The cubic root of 1121000323 is about 1038.8079052310.
Adding to 1121000323 its reverse (3230001211), we get a palindrome (4351001534).
The spelling of 1121000323 in words is "one billion, one hundred twenty-one million, three hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •