Base | Representation |
---|---|
bin | 1010000000100101000000… |
… | …10000001011011000110101 |
3 | 2212221010220210011100102120 |
4 | 11000102200100023120311 |
5 | 10341103141330121323 |
6 | 114451144551030153 |
7 | 4431114551543325 |
oct | 500224020133065 |
9 | 85833823140376 |
10 | 22010101020213 |
11 | 7016482250909 |
12 | 257585636b359 |
13 | c3870b445537 |
14 | 56141a449285 |
15 | 2827eea285e3 |
hex | 1404a040b635 |
22010101020213 has 32 divisors (see below), whose sum is σ = 30379415126400. Its totient is φ = 14157785913600.
The previous prime is 22010101020211. The next prime is 22010101020263. The reversal of 22010101020213 is 31202010101022.
It is not a de Polignac number, because 22010101020213 - 21 = 22010101020211 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22010101020192 and 22010101020201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22010101020211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 845846143 + ... + 845872163.
It is an arithmetic number, because the mean of its divisors is an integer number (949356722700).
Almost surely, 222010101020213 is an apocalyptic number.
It is an amenable number.
22010101020213 is a deficient number, since it is larger than the sum of its proper divisors (8369314106187).
22010101020213 is a wasteful number, since it uses less digits than its factorization.
22010101020213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32293.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 22010101020213 its reverse (31202010101022), we get a palindrome (53212111121235).
It can be divided in two parts, 2201010 and 1020213, that added together give a palindrome (3221223).
The spelling of 22010101020213 in words is "twenty-two trillion, ten billion, one hundred one million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •