Base | Representation |
---|---|
bin | 1001100011110001001011… |
… | …00011100010111111111011 |
3 | 2202102111210212210101000011 |
4 | 10301320211203202333323 |
5 | 10223343332201201021 |
6 | 112412314021122351 |
7 | 4266442103103241 |
oct | 461704543427773 |
9 | 82374725711004 |
10 | 21020200022011 |
11 | 6774686a0a4a3 |
12 | 2435a325593b7 |
13 | b9627251b508 |
14 | 529551376791 |
15 | 266bb4bc8de1 |
hex | 131e258e2ffb |
21020200022011 has 8 divisors (see below), whose sum is σ = 21803686295600. Its totient is φ = 20250106676352.
The previous prime is 21020200021967. The next prime is 21020200022053. The reversal of 21020200022011 is 11022000202012.
It is a happy number.
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 21020200022011 - 27 = 21020200021883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020200021982 and 21020200022000.
It is not an unprimeable number, because it can be changed into a prime (21020200028011) 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, 3348228786 + ... + 3348235063.
It is an arithmetic number, because the mean of its divisors is an integer number (2725460786950).
Almost surely, 221020200022011 is an apocalyptic number.
21020200022011 is a deficient number, since it is larger than the sum of its proper divisors (783486273589).
21020200022011 is an equidigital number, since it uses as much as digits as its factorization.
21020200022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6696463965.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21020200022011 its reverse (11022000202012), we get a palindrome (32042200224023).
The spelling of 21020200022011 in words is "twenty-one trillion, twenty billion, two hundred million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •