Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …01011100001111111111101 |
3 | 2121212220200122110001112110 |
4 | 10203111102023201333331 |
5 | 10111002403124234323 |
6 | 110325055051124233 |
7 | 4134261514304061 |
oct | 443252213417775 |
9 | 77786618401473 |
10 | 20020221321213 |
11 | 641958a011a53 |
12 | 22b4077743679 |
13 | b22b8b79c569 |
14 | 4d2dabab5aa1 |
15 | 24ab8a26d793 |
hex | 1235522e1ffd |
20020221321213 has 8 divisors (see below), whose sum is σ = 26792861248800. Its totient is φ = 13297197803888.
The previous prime is 20020221321211. The next prime is 20020221321229. The reversal of 20020221321213 is 31212312202002.
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 20020221321213 - 21 = 20020221321211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20020221321213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020221321211) 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, 12404101623 + ... + 12404103236.
It is an arithmetic number, because the mean of its divisors is an integer number (3349107656100).
Almost surely, 220020221321213 is an apocalyptic number.
It is an amenable number.
20020221321213 is a deficient number, since it is larger than the sum of its proper divisors (6772639927587).
20020221321213 is a wasteful number, since it uses less digits than its factorization.
20020221321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24808205131.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20020221321213 its reverse (31212312202002), we get a palindrome (51232533523215).
The spelling of 20020221321213 in words is "twenty trillion, twenty billion, two hundred twenty-one million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •