Base | Representation |
---|---|
bin | 1010000111000110011100… |
… | …10100011111001101101100 |
3 | 2220201120101110212221102210 |
4 | 11003203032110133031230 |
5 | 10403241131310420244 |
6 | 115142131151250420 |
7 | 4453240335262104 |
oct | 503431624371554 |
9 | 86646343787383 |
10 | 22234212201324 |
11 | 70a2527163272 |
12 | 25b1180819a10 |
13 | c538a5aba886 |
14 | 56c1da828204 |
15 | 288569b014b9 |
hex | 1438ce51f36c |
22234212201324 has 36 divisors (see below), whose sum is σ = 55111098071624. Its totient is φ = 6975439120896.
The previous prime is 22234212201301. The next prime is 22234212201347. The reversal of 22234212201324 is 42310221243222.
It is an interprime number because it is at equal distance from previous prime (22234212201301) and next prime (22234212201347).
It is a junction number, because it is equal to n+sod(n) for n = 22234212201291 and 22234212201300.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3205621129 + ... + 3205628064.
Almost surely, 222234212201324 is an apocalyptic number.
It is an amenable number.
22234212201324 is an abundant number, since it is smaller than the sum of its proper divisors (32876885870300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22234212201324 is a wasteful number, since it uses less digits than its factorization.
22234212201324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6411249234 (or 6411249215 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 22234212201324 its reverse (42310221243222), we get a palindrome (64544433444546).
The spelling of 22234212201324 in words is "twenty-two trillion, two hundred thirty-four billion, two hundred twelve million, two hundred one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •