Base | Representation |
---|---|
bin | 1010000110001000100110… |
… | …11100001110101000100101 |
3 | 2220121101200201002001212220 |
4 | 11003010103130032220211 |
5 | 10402220133100320401 |
6 | 115115000522302553 |
7 | 4450653530244303 |
oct | 503042334165045 |
9 | 86541621061786 |
10 | 22201012120101 |
11 | 708a43a620911 |
12 | 25a6856057a59 |
13 | c50714758cb9 |
14 | 56a76b3b3273 |
15 | 2877750b0336 |
hex | 14311370ea25 |
22201012120101 has 32 divisors (see below), whose sum is σ = 29708651232000. Its totient is φ = 14747150745600.
The previous prime is 22201012120097. The next prime is 22201012120103. The reversal of 22201012120101 is 10102121010222.
It is not a de Polignac number, because 22201012120101 - 22 = 22201012120097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201012120103) 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 31 ways as a sum of consecutive naturals, for example, 2108553205 + ... + 2108563733.
It is an arithmetic number, because the mean of its divisors is an integer number (928395351000).
Almost surely, 222201012120101 is an apocalyptic number.
It is an amenable number.
22201012120101 is a deficient number, since it is larger than the sum of its proper divisors (7507639111899).
22201012120101 is a wasteful number, since it uses less digits than its factorization.
22201012120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13309.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22201012120101 its reverse (10102121010222), we get a palindrome (32303133130323).
It can be divided in two parts, 222010121 and 20101, that added together give a palindrome (222030222).
The spelling of 22201012120101 in words is "twenty-two trillion, two hundred one billion, twelve million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •