Base | Representation |
---|---|
bin | 1010000000100101001101… |
… | …10011101110001101111101 |
3 | 2212221011012110002221222221 |
4 | 11000102212303232031331 |
5 | 10341103403004014323 |
6 | 114451203520205341 |
7 | 4431120355425541 |
oct | 500224663561575 |
9 | 85834173087887 |
10 | 22010211001213 |
11 | 701652933a1a6 |
12 | 2575887169851 |
13 | c38728172056 |
14 | 56142acb7a21 |
15 | 28280950055d |
hex | 1404a6cee37d |
22010211001213 has 8 divisors (see below), whose sum is σ = 23459266578240. Its totient is φ = 20578304011200.
The previous prime is 22010211001211. The next prime is 22010211001223. The reversal of 22010211001213 is 31210011201022.
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 22010211001213 - 21 = 22010211001211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22010211001211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4287144103 + ... + 4287149236.
It is an arithmetic number, because the mean of its divisors is an integer number (2932408322280).
Almost surely, 222010211001213 is an apocalyptic number.
It is an amenable number.
22010211001213 is a deficient number, since it is larger than the sum of its proper divisors (1449055577027).
22010211001213 is a wasteful number, since it uses less digits than its factorization.
22010211001213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8574293507.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 22010211001213 its reverse (31210011201022), we get a palindrome (53220222202235).
The spelling of 22010211001213 in words is "twenty-two trillion, ten billion, two hundred eleven million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •