Base | Representation |
---|---|
bin | 1010000000100101001101… |
… | …10000101101100100010001 |
3 | 2212221011012101121212120000 |
4 | 11000102212300231210101 |
5 | 10341103402303241423 |
6 | 114451203451240213 |
7 | 4431120345631134 |
oct | 500224660554421 |
9 | 85834171555500 |
10 | 22010210212113 |
11 | 7016528950352 |
12 | 2575886a49069 |
13 | c38727c56b26 |
14 | 56142ab5021b |
15 | 2828093e6843 |
hex | 1404a6c2d911 |
22010210212113 has 40 divisors (see below), whose sum is σ = 34617064278720. Its totient is φ = 13898326796640.
The previous prime is 22010210212103. The next prime is 22010210212117. The reversal of 22010210212113 is 31121201201022.
22010210212113 is a `hidden beast` number, since 220 + 1 + 0 + 210 + 21 + 211 + 3 = 666.
It is not a de Polignac number, because 22010210212113 - 222 = 22010206017809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22010210212117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6028431 + ... + 8964507.
It is an arithmetic number, because the mean of its divisors is an integer number (865426606968).
Almost surely, 222010210212113 is an apocalyptic number.
It is an amenable number.
22010210212113 is a deficient number, since it is larger than the sum of its proper divisors (12606854066607).
22010210212113 is a wasteful number, since it uses less digits than its factorization.
22010210212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2940979 (or 2940970 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 22010210212113 its reverse (31121201201022), we get a palindrome (53131411413135).
The spelling of 22010210212113 in words is "twenty-two trillion, ten billion, two hundred ten million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.299 sec. • engine limits •