Base | Representation |
---|---|
bin | 11101000110101001100… |
… | …00111110011101011011 |
3 | 10112121011212020010001201 |
4 | 32203110300332131123 |
5 | 112341001004134321 |
6 | 2043221121455031 |
7 | 132150660634534 |
oct | 16432460763533 |
9 | 3477155203051 |
10 | 1000002021211 |
11 | 35610a086516 |
12 | 1419827a1477 |
13 | 733b882581b |
14 | 3658681168b |
15 | 1b02ba15291 |
hex | e8d4c3e75b |
1000002021211 has 4 divisors (see below), whose sum is σ = 1009903031424. Its totient is φ = 990101011000.
The previous prime is 1000002021199. The next prime is 1000002021223. The reversal of 1000002021211 is 1121202000001.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1000002021199) and next prime (1000002021223).
It is a cyclic number.
It is not a de Polignac number, because 1000002021211 - 221 = 999999924059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000002021511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4950504955 + ... + 4950505156.
It is an arithmetic number, because the mean of its divisors is an integer number (252475757856).
Almost surely, 21000002021211 is an apocalyptic number.
1000002021211 is a deficient number, since it is larger than the sum of its proper divisors (9901010213).
1000002021211 is an equidigital number, since it uses as much as digits as its factorization.
1000002021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9901010212.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000002021211 its reverse (1121202000001), we get a palindrome (2121204021212).
The spelling of 1000002021211 in words is "one trillion, two million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •