Base | Representation |
---|---|
bin | 1010001100000110011011… |
… | …1101011110110100011110 |
3 | 1110122222220110220220012120 |
4 | 2203001212331132310132 |
5 | 2432022222014213042 |
6 | 35454331011043410 |
7 | 2234250556443414 |
oct | 243014675366436 |
9 | 43588813826176 |
10 | 11203002101022 |
11 | 362a191696036 |
12 | 130b2728a0566 |
13 | 6335916b1b64 |
14 | 2aa32a2492b4 |
15 | 146638489dec |
hex | a3066f5ed1e |
11203002101022 has 16 divisors (see below), whose sum is σ = 22406516548752. Its totient is φ = 3734248642560.
The previous prime is 11203002101021. The next prime is 11203002101023. The reversal of 11203002101022 is 22010120030211.
It is an interprime number because it is at equal distance from previous prime (11203002101021) and next prime (11203002101023).
It is a junction number, because it is equal to n+sod(n) for n = 11203002100992 and 11203002101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11203002101021) 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, 21063229 + ... + 21588552.
It is an arithmetic number, because the mean of its divisors is an integer number (1400407284297).
Almost surely, 211203002101022 is an apocalyptic number.
11203002101022 is an abundant number, since it is smaller than the sum of its proper divisors (11203514447730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11203002101022 is a wasteful number, since it uses less digits than its factorization.
11203002101022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42695563.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11203002101022 its reverse (22010120030211), we get a palindrome (33213122131233).
The spelling of 11203002101022 in words is "eleven trillion, two hundred three billion, two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •