Base | Representation |
---|---|
bin | 11101001010110000110… |
… | …11101001000011010011 |
3 | 10112210212210211221010010 |
4 | 32211120123221003103 |
5 | 112410012010133021 |
6 | 2044224232210003 |
7 | 132256503056304 |
oct | 16453033510323 |
9 | 3483783757103 |
10 | 1002211021011 |
11 | 357042aa2792 |
12 | 14229a539903 |
13 | 7367b3886b5 |
14 | 36715d527ab |
15 | 1b10a90d976 |
hex | e9586e90d3 |
1002211021011 has 8 divisors (see below), whose sum is σ = 1336286670480. Its totient is φ = 668138026112.
The previous prime is 1002211021001. The next prime is 1002211021027. The reversal of 1002211021011 is 1101201122001.
1002211021011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1002211021011 - 222 = 1002206826707 is a prime.
It is a super-2 number, since 2×10022110210112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1002211021001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 517711 + ... + 1507463.
It is an arithmetic number, because the mean of its divisors is an integer number (167035833810).
Almost surely, 21002211021011 is an apocalyptic number.
1002211021011 is a deficient number, since it is larger than the sum of its proper divisors (334075649469).
1002211021011 is an equidigital number, since it uses as much as digits as its factorization.
1002211021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1327285.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1002211021011 its reverse (1101201122001), we get a palindrome (2103412143012).
The spelling of 1002211021011 in words is "one trillion, two billion, two hundred eleven million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •