Base | Representation |
---|---|
bin | 1001001100011110111001… |
… | …00110011011000010010001 |
3 | 2122121000122101020211212121 |
4 | 10212033130212123002101 |
5 | 10122241242200401001 |
6 | 111000554040454241 |
7 | 4154566141133041 |
oct | 446173446330221 |
9 | 78530571224777 |
10 | 20220112122001 |
11 | 6496335179170 |
12 | 232696277a381 |
13 | b389962a69cc |
14 | 4dc93148d721 |
15 | 250e88d226a1 |
hex | 1263dc99b091 |
20220112122001 has 4 divisors (see below), whose sum is σ = 22058304133104. Its totient is φ = 18381920110900.
The previous prime is 20220112121981. The next prime is 20220112122029. The reversal of 20220112122001 is 10022121102202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20220112122001 - 241 = 18021088866449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20220112122071) 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, 919096005535 + ... + 919096005556.
It is an arithmetic number, because the mean of its divisors is an integer number (5514576033276).
Almost surely, 220220112122001 is an apocalyptic number.
It is an amenable number.
20220112122001 is a deficient number, since it is larger than the sum of its proper divisors (1838192011103).
20220112122001 is a wasteful number, since it uses less digits than its factorization.
20220112122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838192011102.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20220112122001 its reverse (10022121102202), we get a palindrome (30242233224203).
The spelling of 20220112122001 in words is "twenty trillion, two hundred twenty billion, one hundred twelve million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •