Base | Representation |
---|---|
bin | 1001001100100000100011… |
… | …00001011111100001010101 |
3 | 2122121002221020222211211111 |
4 | 10212100101201133201111 |
5 | 10122300102001201401 |
6 | 111001222115335021 |
7 | 4154630142145054 |
oct | 446202141374125 |
9 | 78532836884744 |
10 | 20221000022101 |
11 | 64967503966aa |
12 | 2326b6bbb1471 |
13 | b38aa8224a98 |
14 | 4dc9b737a39b |
15 | 250edbc5de51 |
hex | 12641185f855 |
20221000022101 has 8 divisors (see below), whose sum is σ = 20553016657664. Its totient is φ = 19889000316720.
The previous prime is 20221000022089. The next prime is 20221000022149. The reversal of 20221000022101 is 10122000012202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20221000022101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20221000022191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1812921 + ... + 6612766.
It is an arithmetic number, because the mean of its divisors is an integer number (2569127082208).
Almost surely, 220221000022101 is an apocalyptic number.
It is an amenable number.
20221000022101 is a deficient number, since it is larger than the sum of its proper divisors (332016635563).
20221000022101 is an equidigital number, since it uses as much as digits as its factorization.
20221000022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8465091.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20221000022101 its reverse (10122000012202), we get a palindrome (30343000034303).
The spelling of 20221000022101 in words is "twenty trillion, two hundred twenty-one billion, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •