Base | Representation |
---|---|
bin | 1001000110101100000011… |
… | …11001111000110010010001 |
3 | 2121212222202110001212112022 |
4 | 10203112001321320302101 |
5 | 10111011023113033241 |
6 | 110325310332341225 |
7 | 4134320406055244 |
oct | 443260171706221 |
9 | 77788673055468 |
10 | 20021022002321 |
11 | 641995aa7857a |
12 | 22b425b914815 |
13 | b22c88630472 |
14 | 4d304617b25b |
15 | 24abd56cc54b |
hex | 123581e78c91 |
20021022002321 has 8 divisors (see below), whose sum is σ = 20145065585664. Its totient is φ = 19897187777280.
The previous prime is 20021022002279. The next prime is 20021022002327. The reversal of 20021022002321 is 12320022012002.
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 20021022002321 - 210 = 20021022001297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20021022002321.
It is not an unprimeable number, because it can be changed into a prime (20021022002327) 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, 52147721 + ... + 52530246.
It is an arithmetic number, because the mean of its divisors is an integer number (2518133198208).
Almost surely, 220021022002321 is an apocalyptic number.
It is an amenable number.
20021022002321 is a deficient number, since it is larger than the sum of its proper divisors (124043583343).
20021022002321 is a wasteful number, since it uses less digits than its factorization.
20021022002321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104679151.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 20021022002321 its reverse (12320022012002), we get a palindrome (32341044014323).
The spelling of 20021022002321 in words is "twenty trillion, twenty-one billion, twenty-two million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •