Base | Representation |
---|---|
bin | 1010000000011001101110… |
… | …01000000000011000011000 |
3 | 2212220120021112121121212202 |
4 | 11000030313020000120120 |
5 | 10341003234312144000 |
6 | 114444303435425332 |
7 | 4430511452362622 |
oct | 500146710003030 |
9 | 85816245547782 |
10 | 22004042303000 |
11 | 70139532659aa |
12 | 25746452b5248 |
13 | c37c8415b674 |
14 | 561003913c12 |
15 | 282597b92dd5 |
hex | 140337200618 |
22004042303000 has 32 divisors (see below), whose sum is σ = 51489458991360. Its totient is φ = 8801616920800.
The previous prime is 22004042302981. The next prime is 22004042303003. The reversal of 22004042303000 is 30324040022.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22004042303003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11002020152 + ... + 11002022151.
It is an arithmetic number, because the mean of its divisors is an integer number (1609045593480).
Almost surely, 222004042303000 is an apocalyptic number.
22004042303000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22004042303000 is an abundant number, since it is smaller than the sum of its proper divisors (29485416688360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22004042303000 is a wasteful number, since it uses less digits than its factorization.
22004042303000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22004042324 (or 22004042310 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 20.
Adding to 22004042303000 its reverse (30324040022), we get a palindrome (22034366343022).
The spelling of 22004042303000 in words is "twenty-two trillion, four billion, forty-two million, three hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •