Base | Representation |
---|---|
bin | 1010001100000100010001… |
… | …1000111111011100111010 |
3 | 1110122221102001120022002222 |
4 | 2203001010120333130322 |
5 | 2432020030030010020 |
6 | 35454153251524042 |
7 | 2234230314551465 |
oct | 243010430773472 |
9 | 43587361508088 |
10 | 11202422110010 |
11 | 3629a1426421a |
12 | 130b1305b9622 |
13 | 6334cb4a0801 |
14 | 2aa2b31d02dc |
15 | 1466025c0b25 |
hex | a304463f73a |
11202422110010 has 16 divisors (see below), whose sum is σ = 21041071094016. Its totient is φ = 4286144111568.
The previous prime is 11202422109913. The next prime is 11202422110013. The reversal of 11202422110010 is 1001122420211.
It is a super-2 number, since 2×112024221100102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11202422110013) 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, 24353091314 + ... + 24353091773.
It is an arithmetic number, because the mean of its divisors is an integer number (1315066943376).
Almost surely, 211202422110010 is an apocalyptic number.
11202422110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11202422110010 is a deficient number, since it is larger than the sum of its proper divisors (9838648984006).
11202422110010 is a wasteful number, since it uses less digits than its factorization.
11202422110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48706183117.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11202422110010 its reverse (1001122420211), we get a palindrome (12203544530221).
The spelling of 11202422110010 in words is "eleven trillion, two hundred two billion, four hundred twenty-two million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •