Base | Representation |
---|---|
bin | 111011101110110… |
… | …000000101001111 |
3 | 2120211122112021202 |
4 | 323232300011033 |
5 | 4023020030221 |
6 | 243234420115 |
7 | 33555543215 |
oct | 7356600517 |
9 | 2524575252 |
10 | 1002111311 |
11 | 474736073 |
12 | 23b73163b |
13 | 12c7c9196 |
14 | 9713acb5 |
15 | 5ce9bd0b |
hex | 3bbb014f |
1002111311 has 8 divisors (see below), whose sum is σ = 1046152800. Its totient is φ = 958109152.
The previous prime is 1002111277. The next prime is 1002111361. The reversal of 1002111311 is 1131112001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1002111311 - 214 = 1002094927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002111292 and 1002111301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002111361) 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 in 7 ways as a sum of consecutive naturals, for example, 50081 + ... + 67173.
It is an arithmetic number, because the mean of its divisors is an integer number (130769100).
Almost surely, 21002111311 is an apocalyptic number.
1002111311 is a deficient number, since it is larger than the sum of its proper divisors (44041489).
1002111311 is a wasteful number, since it uses less digits than its factorization.
1002111311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19665.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1002111311 is about 31656.1417579591. The cubic root of 1002111311 is about 1000.7032756208.
Adding to 1002111311 its reverse (1131112001), we get a palindrome (2133223312).
The spelling of 1002111311 in words is "one billion, two million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •