Base | Representation |
---|---|
bin | 100001011100010… |
… | …0011100100010011 |
3 | 2220012110201000012 |
4 | 1002320203210103 |
5 | 4244230401003 |
6 | 303202545135 |
7 | 36543610502 |
oct | 10270434423 |
9 | 2805421005 |
10 | 1122122003 |
11 | 526454962 |
12 | 2739681ab |
13 | 14b627c22 |
14 | a905a839 |
15 | 687a58d8 |
hex | 42e23913 |
1122122003 has 4 divisors (see below), whose sum is σ = 1141141080. Its totient is φ = 1103102928.
The previous prime is 1122121997. The next prime is 1122122011. The reversal of 1122122003 is 3002212211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1122122003 - 214 = 1122105619 is a prime.
It is a super-3 number, since 3×11221220033 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1122122203) 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 3 ways as a sum of consecutive naturals, for example, 9509450 + ... + 9509567.
It is an arithmetic number, because the mean of its divisors is an integer number (285285270).
Almost surely, 21122122003 is an apocalyptic number.
1122122003 is a deficient number, since it is larger than the sum of its proper divisors (19019077).
1122122003 is an equidigital number, since it uses as much as digits as its factorization.
1122122003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19019076.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1122122003 is about 33498.0895425396. The cubic root of 1122122003 is about 1039.1542689814.
Adding to 1122122003 its reverse (3002212211), we get a palindrome (4124334214).
The spelling of 1122122003 in words is "one billion, one hundred twenty-two million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •