Base | Representation |
---|---|
bin | 1010000000100101001100… |
… | …01010100100001010010001 |
3 | 2212221011011200210211010122 |
4 | 11000102212022210022101 |
5 | 10341103342223241423 |
6 | 114451202453040025 |
7 | 4431120164631461 |
oct | 500224612441221 |
9 | 85834150724118 |
10 | 22010200212113 |
11 | 7016523240193 |
12 | 2575883626015 |
13 | c38725b65279 |
14 | 5614296a9ba1 |
15 | 2828085bd8c8 |
hex | 1404a62a4291 |
22010200212113 has 8 divisors (see below), whose sum is σ = 22031836157568. Its totient is φ = 21988570477104.
The previous prime is 22010200212079. The next prime is 22010200212151. The reversal of 22010200212113 is 31121200201022.
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 22010200212113 - 226 = 22010133103249 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22010200212091 and 22010200212100.
It is not an unprimeable number, because it can be changed into a prime (22010202212113) 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, 5554970 + ... + 8653212.
It is an arithmetic number, because the mean of its divisors is an integer number (2753979519696).
Almost surely, 222010200212113 is an apocalyptic number.
It is an amenable number.
22010200212113 is a deficient number, since it is larger than the sum of its proper divisors (21635945455).
22010200212113 is a wasteful number, since it uses less digits than its factorization.
22010200212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3105223.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 22010200212113 its reverse (31121200201022), we get a palindrome (53131400413135).
The spelling of 22010200212113 in words is "twenty-two trillion, ten billion, two hundred million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •