Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …10101000001000101101101 |
3 | 2212220101112011102010001221 |
4 | 11000023021111001011231 |
5 | 10340441001224020023 |
6 | 114443400553303341 |
7 | 4430415014053366 |
oct | 500131125010555 |
9 | 85811464363057 |
10 | 22002200220013 |
11 | 7013098478772 |
12 | 2574210404b51 |
13 | c37a4c625930 |
14 | 560cab004b6d |
15 | 2824db0c585d |
hex | 1402c954116d |
22002200220013 has 16 divisors (see below), whose sum is σ = 23704549989120. Its totient is φ = 20301262180416.
The previous prime is 22002200219977. The next prime is 22002200220017. The reversal of 22002200220013 is 31002200220022.
It is a cyclic number.
It is not a de Polignac number, because 22002200220013 - 29 = 22002200219501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22002200220017) 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 15 ways as a sum of consecutive naturals, for example, 583330831 + ... + 583368547.
It is an arithmetic number, because the mean of its divisors is an integer number (1481534374320).
Almost surely, 222002200220013 is an apocalyptic number.
It is an amenable number.
22002200220013 is a deficient number, since it is larger than the sum of its proper divisors (1702349769107).
22002200220013 is a wasteful number, since it uses less digits than its factorization.
22002200220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55236.
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 22002200220013 its reverse (31002200220022), we get a palindrome (53004400440035).
Subtracting 22002200220013 from its reverse (31002200220022), we obtain a palindrome (9000000000009).
The spelling of 22002200220013 in words is "twenty-two trillion, two billion, two hundred million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •