Base | Representation |
---|---|
bin | 1010000000100101000001… |
… | …11110110000010010110000 |
3 | 2212221010221122010200002220 |
4 | 11000102200332300102300 |
5 | 10341103202441330000 |
6 | 114451150104441040 |
7 | 4431115060405350 |
oct | 500224076602260 |
9 | 85833848120086 |
10 | 22010113230000 |
11 | 7016489130245 |
12 | 257585a479180 |
13 | c38710b2bb6c |
14 | 56141bd06b60 |
15 | 282800b3b1a0 |
hex | 1404a0fb04b0 |
22010113230000 has 800 divisors, whose sum is σ = 83498134444032. Its totient is φ = 4889548800000.
The previous prime is 22010113229971. The next prime is 22010113230023. The reversal of 22010113230000 is 3231101022.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 2333305284 + ... + 2333314716.
Almost surely, 222010113230000 is an apocalyptic number.
22010113230000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22010113230000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41749067222016).
22010113230000 is an abundant number, since it is smaller than the sum of its proper divisors (61488021214032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22010113230000 is a wasteful number, since it uses less digits than its factorization.
22010113230000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9783 (or 9762 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 22010113230000 its reverse (3231101022), we get a palindrome (22013344331022).
The spelling of 22010113230000 in words is "twenty-two trillion, ten billion, one hundred thirteen million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •