Base | Representation |
---|---|
bin | 1010000001100100111001… |
… | …1100010010101100101000 |
3 | 1110000201020012212021200012 |
4 | 2200121032130102230220 |
5 | 2421041432220333000 |
6 | 35235310232031052 |
7 | 2215220305122140 |
oct | 240311634225450 |
9 | 43021205767605 |
10 | 11022202121000 |
11 | 356a542827044 |
12 | 12a0215232488 |
13 | 61c50a0c3865 |
14 | 2a16980cb920 |
15 | 141aa5910735 |
hex | a064e712b28 |
11022202121000 has 64 divisors (see below), whose sum is σ = 29476517690880. Its totient is φ = 3779040724800.
The previous prime is 11022202120987. The next prime is 11022202121009. The reversal of 11022202121000 is 12120222011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (11022202121009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 787293152 + ... + 787307151.
It is an arithmetic number, because the mean of its divisors is an integer number (460570588920).
Almost surely, 211022202121000 is an apocalyptic number.
11022202121000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11022202121000 is an abundant number, since it is smaller than the sum of its proper divisors (18454315569880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022202121000 is a wasteful number, since it uses less digits than its factorization.
11022202121000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1574600331 (or 1574600317 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11022202121000 its reverse (12120222011), we get a palindrome (11034322343011).
The spelling of 11022202121000 in words is "eleven trillion, twenty-two billion, two hundred two million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •