Base | Representation |
---|---|
bin | 10101000100010001… |
… | …11111110101100010 |
3 | 1002012020010210200011 |
4 | 22202020333311202 |
5 | 141130402432320 |
6 | 5110144515134 |
7 | 550164063316 |
oct | 124210776542 |
9 | 32166123604 |
10 | 11310202210 |
11 | 488435035a |
12 | 223791baaa |
13 | 10b3288058 |
14 | 79417bb46 |
15 | 462e1605a |
hex | 2a223fd62 |
11310202210 has 8 divisors (see below), whose sum is σ = 20358363996. Its totient is φ = 4524080880.
The previous prime is 11310202201. The next prime is 11310202271. The reversal of 11310202210 is 1220201311.
11310202210 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9230021329 + 2080180881 = 96073^2 + 45609^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×113102022103 (a number of 31 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 565510101 + ... + 565510120.
Almost surely, 211310202210 is an apocalyptic number.
11310202210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11310202210 is a deficient number, since it is larger than the sum of its proper divisors (9048161786).
11310202210 is a wasteful number, since it uses less digits than its factorization.
11310202210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131020228.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11310202210 its reverse (1220201311), we get a palindrome (12530403521).
The spelling of 11310202210 in words is "eleven billion, three hundred ten million, two hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •