Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00010011001011001011 |
3 | 10112200210210202100211001 |
4 | 32210101130103023023 |
5 | 112400042110324321 |
6 | 2043510124515431 |
7 | 132215131463443 |
oct | 16442134231313 |
9 | 3480723670731 |
10 | 1001020011211 |
11 | 356591777470 |
12 | 1420076abb77 |
13 | 7351b6c127c |
14 | 36641ac3123 |
15 | 1b08b09bc91 |
hex | e9117132cb |
1001020011211 has 4 divisors (see below), whose sum is σ = 1092021830424. Its totient is φ = 910018192000.
The previous prime is 1001020011203. The next prime is 1001020011221. The reversal of 1001020011211 is 1121100201001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1001020011211 - 23 = 1001020011203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001020011221) 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 3 ways as a sum of consecutive naturals, for example, 45500909590 + ... + 45500909611.
It is an arithmetic number, because the mean of its divisors is an integer number (273005457606).
Almost surely, 21001020011211 is an apocalyptic number.
1001020011211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001020011211 is a deficient number, since it is larger than the sum of its proper divisors (91001819213).
1001020011211 is an equidigital number, since it uses as much as digits as its factorization.
1001020011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91001819212.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001020011211 its reverse (1121100201001), we get a palindrome (2122120212212).
The spelling of 1001020011211 in words is "one trillion, one billion, twenty million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •