Base | Representation |
---|---|
bin | 1001010001110001110000… |
… | …1011001011110111001101 |
3 | 1100010012121121212102202120 |
4 | 2110130130023023313031 |
5 | 2314113142111202341 |
6 | 33410141153443153 |
7 | 2101666533343110 |
oct | 224343413136715 |
9 | 40105547772676 |
10 | 10201020022221 |
11 | 3283256953a96 |
12 | 1189038b704b9 |
13 | 58cc4b8a5132 |
14 | 273a36890577 |
15 | 12a542c01066 |
hex | 9471c2cbdcd |
10201020022221 has 16 divisors (see below), whose sum is σ = 15544844272128. Its totient is φ = 5828991994800.
The previous prime is 10201020022199. The next prime is 10201020022231. The reversal of 10201020022221 is 12222002010201.
It is not a de Polignac number, because 10201020022221 - 25 = 10201020022189 is a prime.
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 10201020022221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201020022231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5988415 + ... + 7500876.
It is an arithmetic number, because the mean of its divisors is an integer number (971552767008).
Almost surely, 210201020022221 is an apocalyptic number.
It is an amenable number.
10201020022221 is a deficient number, since it is larger than the sum of its proper divisors (5343824249907).
10201020022221 is a wasteful number, since it uses less digits than its factorization.
10201020022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13525312.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10201020022221 its reverse (12222002010201), we get a palindrome (22423022032422).
The spelling of 10201020022221 in words is "ten trillion, two hundred one billion, twenty million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •