Base | Representation |
---|---|
bin | 1010000110011111011111… |
… | …11110111001010101101110 |
3 | 2220122120102012220021001211 |
4 | 11003033233332321111232 |
5 | 10402420320321130110 |
6 | 115124352232025034 |
7 | 4451600222512114 |
oct | 503175776712556 |
9 | 86576365807054 |
10 | 22213302130030 |
11 | 7094676a53210 |
12 | 25a9105b3217a |
13 | c51922a0141b |
14 | 56b1b5723ab4 |
15 | 287c4401998a |
hex | 1433effb956e |
22213302130030 has 32 divisors (see below), whose sum is σ = 44682722165088. Its totient is φ = 7880550643200.
The previous prime is 22213302129979. The next prime is 22213302130091. The reversal of 22213302130030 is 3003120331222.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 22213302129983 and 22213302130010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2462667567 + ... + 2462676586.
It is an arithmetic number, because the mean of its divisors is an integer number (1396335067659).
Almost surely, 222213302130030 is an apocalyptic number.
22213302130030 is an abundant number, since it is smaller than the sum of its proper divisors (22469420035058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22213302130030 is a wasteful number, since it uses less digits than its factorization.
22213302130030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4925344212.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 22213302130030 its reverse (3003120331222), we get a palindrome (25216422461252).
The spelling of 22213302130030 in words is "twenty-two trillion, two hundred thirteen billion, three hundred two million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •