Base | Representation |
---|---|
bin | 1001000110101100001111… |
… | …10111110011110111110001 |
3 | 2121220000000102110102210222 |
4 | 10203112013313303313301 |
5 | 10111011224230334301 |
6 | 110325324310302425 |
7 | 4134323033054105 |
oct | 443260767636761 |
9 | 77800012412728 |
10 | 20021122121201 |
11 | 6419a01540353 |
12 | 22b4289357a15 |
13 | b22ca32b60c6 |
14 | 4d305559d905 |
15 | 24abde3a731b |
hex | 123587df3df1 |
20021122121201 has 96 divisors (see below), whose sum is σ = 23341950019584. Its totient is φ = 17075464243200.
The previous prime is 20021122121191. The next prime is 20021122121219. The reversal of 20021122121201 is 10212122112002.
It is not a de Polignac number, because 20021122121201 - 222 = 20021117926897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 20021122121201.
It is not an unprimeable number, because it can be changed into a prime (20021122121251) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5111338895 + ... + 5111342811.
It is an arithmetic number, because the mean of its divisors is an integer number (243145312704).
Almost surely, 220021122121201 is an apocalyptic number.
It is an amenable number.
20021122121201 is a deficient number, since it is larger than the sum of its proper divisors (3320827898383).
20021122121201 is a wasteful number, since it uses less digits than its factorization.
20021122121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4303 (or 4272 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20021122121201 its reverse (10212122112002), we get a palindrome (30233244233203).
The spelling of 20021122121201 in words is "twenty trillion, twenty-one billion, one hundred twenty-two million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •