Base | Representation |
---|---|
bin | 11101101111101000000… |
… | …00100000000100011011 |
3 | 10121200222000020002210111 |
4 | 32313310000200010123 |
5 | 113221024230134321 |
6 | 2101300100425151 |
7 | 133560065230012 |
oct | 16676400400433 |
9 | 3550860202714 |
10 | 1022001021211 |
11 | 364478a29855 |
12 | 1460a20a81b7 |
13 | 754b33b75a1 |
14 | 376723b1a79 |
15 | 1b8b7ee75e1 |
hex | edf402011b |
1022001021211 has 4 divisors (see below), whose sum is σ = 1022716208800. Its totient is φ = 1021285833624.
The previous prime is 1022001021179. The next prime is 1022001021241. The reversal of 1022001021211 is 1121201002201.
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 1022001021211 - 25 = 1022001021179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022001021191 and 1022001021200.
It is not an unprimeable number, because it can be changed into a prime (1022001021241) 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 3 ways as a sum of consecutive naturals, for example, 357591651 + ... + 357594508.
It is an arithmetic number, because the mean of its divisors is an integer number (255679052200).
Almost surely, 21022001021211 is an apocalyptic number.
1022001021211 is a deficient number, since it is larger than the sum of its proper divisors (715187589).
1022001021211 is an equidigital number, since it uses as much as digits as its factorization.
1022001021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715187588.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1022001021211 its reverse (1121201002201), we get a palindrome (2143202023412).
The spelling of 1022001021211 in words is "one trillion, twenty-two billion, one million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •