Base | Representation |
---|---|
bin | 11101001010011001000… |
… | …01000010111100101011 |
3 | 10112210100212200110102110 |
4 | 32211030201002330223 |
5 | 112404104321024321 |
6 | 2044152331333403 |
7 | 132251524626015 |
oct | 16451441027453 |
9 | 3483325613373 |
10 | 1002011111211 |
11 | 356a50171580 |
12 | 1422435b1263 |
13 | 73648b33486 |
14 | 366d75951b5 |
15 | 1b0e80c1176 |
hex | e94c842f2b |
1002011111211 has 8 divisors (see below), whose sum is σ = 1457470707264. Its totient is φ = 607279461320.
The previous prime is 1002011111197. The next prime is 1002011111221. The reversal of 1002011111211 is 1121111102001.
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 1002011111211 - 29 = 1002011110699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1002011111221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15181986501 + ... + 15181986566.
It is an arithmetic number, because the mean of its divisors is an integer number (182183838408).
Almost surely, 21002011111211 is an apocalyptic number.
1002011111211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1002011111211 is a deficient number, since it is larger than the sum of its proper divisors (455459596053).
1002011111211 is a wasteful number, since it uses less digits than its factorization.
1002011111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30363973081.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1002011111211 its reverse (1121111102001), we get a palindrome (2123122213212).
The spelling of 1002011111211 in words is "one trillion, two billion, eleven million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •