Base | Representation |
---|---|
bin | 10100101101101001… |
… | …01010010111010010 |
3 | 1001200222211212222212 |
4 | 22112310222113102 |
5 | 140233300301002 |
6 | 5035243032122 |
7 | 542400114566 |
oct | 122664522722 |
9 | 31628755885 |
10 | 11120322002 |
11 | 479714a569 |
12 | 21a420b642 |
13 | 1082b34cba |
14 | 776c716a6 |
15 | 45140a352 |
hex | 296d2a5d2 |
11120322002 has 4 divisors (see below), whose sum is σ = 16680483006. Its totient is φ = 5560161000.
The previous prime is 11120321999. The next prime is 11120322007. The reversal of 11120322002 is 20022302111.
It is a happy number.
11120322002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 20022302111 = 7 ⋅2860328873.
It can be written as a sum of positive squares in only one way, i.e., 9185113921 + 1935208081 = 95839^2 + 43991^2 .
It is a super-2 number, since 2×111203220022 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11120322007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2780080499 + ... + 2780080502.
Almost surely, 211120322002 is an apocalyptic number.
11120322002 is a deficient number, since it is larger than the sum of its proper divisors (5560161004).
11120322002 is an equidigital number, since it uses as much as digits as its factorization.
11120322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5560161003.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11120322002 its reverse (20022302111), we get a palindrome (31142624113).
The spelling of 11120322002 in words is "eleven billion, one hundred twenty million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •