Base | Representation |
---|---|
bin | 111011101110110… |
… | …000010000001011 |
3 | 2120211122120020200 |
4 | 323232300100023 |
5 | 4023020041021 |
6 | 243234423243 |
7 | 33555545235 |
oct | 7356602013 |
9 | 2524576220 |
10 | 1002112011 |
11 | 47473664a |
12 | 23b731b23 |
13 | 12c7c95b4 |
14 | 9713b255 |
15 | 5ce9c126 |
hex | 3bbb040b |
1002112011 has 12 divisors (see below), whose sum is σ = 1454845392. Its totient is φ = 664682256.
The previous prime is 1002111973. The next prime is 1002112019. The reversal of 1002112011 is 1102112001.
It is a happy number.
1002112011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1002112011 - 219 = 1001587723 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1002111984 and 1002112002.
It is not an unprimeable number, because it can be changed into a prime (1002112019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 280831 + ... + 284376.
It is an arithmetic number, because the mean of its divisors is an integer number (121237116).
Almost surely, 21002112011 is an apocalyptic number.
1002112011 is a deficient number, since it is larger than the sum of its proper divisors (452733381).
1002112011 is a wasteful number, since it uses less digits than its factorization.
1002112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565410 (or 565407 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1002112011 is about 31656.1528142635. The cubic root of 1002112011 is about 1000.7035086262.
Adding to 1002112011 its reverse (1102112001), we get a palindrome (2104224012).
The spelling of 1002112011 in words is "one billion, two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •