Base | Representation |
---|---|
bin | 1010000001100001010000… |
… | …0010010001010011001010 |
3 | 1110000121200221000012120200 |
4 | 2200120110002101103022 |
5 | 2421032430342033002 |
6 | 35235025105233030 |
7 | 2215154106114630 |
oct | 240302402212312 |
9 | 43017627005520 |
10 | 11021222221002 |
11 | 356a08a691734 |
12 | 129bba1032776 |
13 | 61c3b20a3486 |
14 | 2a1603cd3350 |
15 | 141a4989eb1c |
hex | a06140914ca |
11021222221002 has 192 divisors, whose sum is σ = 27752699520000. Its totient is φ = 3095969071104.
The previous prime is 11021222220977. The next prime is 11021222221033. The reversal of 11021222221002 is 20012222212011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3310668874 + ... + 3310672202.
It is an arithmetic number, because the mean of its divisors is an integer number (144545310000).
Almost surely, 211021222221002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11021222221002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13876349760000).
11021222221002 is an abundant number, since it is smaller than the sum of its proper divisors (16731477298998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021222221002 is a wasteful number, since it uses less digits than its factorization.
11021222221002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4725 (or 4722 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11021222221002 its reverse (20012222212011), we get a palindrome (31033444433013).
The spelling of 11021222221002 in words is "eleven trillion, twenty-one billion, two hundred twenty-two million, two hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •