Base | Representation |
---|---|
bin | 1010000110001100101101… |
… | …01100111000001111000101 |
3 | 2220121121101011212101221010 |
4 | 11003012112230320033011 |
5 | 10402234140330100401 |
6 | 115120003230512433 |
7 | 4451062230413202 |
oct | 503062654701705 |
9 | 86547334771833 |
10 | 22203214300101 |
11 | 709036a6aa28a |
12 | 25a716b665719 |
13 | c509a5a719a3 |
14 | 56a8d9a5aca9 |
15 | 2878535aced6 |
hex | 143196b383c5 |
22203214300101 has 8 divisors (see below), whose sum is σ = 29667678210144. Its totient is φ = 14770446628400.
The previous prime is 22203214300093. The next prime is 22203214300147. The reversal of 22203214300101 is 10100341230222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22203214300101 - 23 = 22203214300093 is a prime.
It is a super-2 number, since 2×222032143001012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22203214300151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7924057950 + ... + 7924060751.
It is an arithmetic number, because the mean of its divisors is an integer number (3708459776268).
Almost surely, 222203214300101 is an apocalyptic number.
It is an amenable number.
22203214300101 is a deficient number, since it is larger than the sum of its proper divisors (7464463910043).
22203214300101 is a wasteful number, since it uses less digits than its factorization.
22203214300101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15848119171.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 22203214300101 its reverse (10100341230222), we get a palindrome (32303555530323).
The spelling of 22203214300101 in words is "twenty-two trillion, two hundred three billion, two hundred fourteen million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •