Base | Representation |
---|---|
bin | 1001001001010001110101… |
… | …01110110001110011001001 |
3 | 2122012111111000200102111212 |
4 | 10210220322232301303021 |
5 | 10113440311142033001 |
6 | 110434230000102505 |
7 | 4143621045331406 |
oct | 444507256616311 |
9 | 78174430612455 |
10 | 20110022221001 |
11 | 6453681305109 |
12 | 2309559904a35 |
13 | b2b4a0290c5b |
14 | 4d748a3872ad |
15 | 24d193dbc7bb |
hex | 124a3abb1cc9 |
20110022221001 has 4 divisors (see below), whose sum is σ = 20309131352004. Its totient is φ = 19910913090000.
The previous prime is 20110022220901. The next prime is 20110022221019. The reversal of 20110022221001 is 10012222001102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19827641574976 + 282380646025 = 4452824^2 + 531395^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110022221001 - 218 = 20110021958857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110022221031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99554565350 + ... + 99554565551.
It is an arithmetic number, because the mean of its divisors is an integer number (5077282838001).
Almost surely, 220110022221001 is an apocalyptic number.
It is an amenable number.
20110022221001 is a deficient number, since it is larger than the sum of its proper divisors (199109131003).
20110022221001 is a wasteful number, since it uses less digits than its factorization.
20110022221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199109131002.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20110022221001 its reverse (10012222001102), we get a palindrome (30122244222103).
The spelling of 20110022221001 in words is "twenty trillion, one hundred ten billion, twenty-two million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •