Base | Representation |
---|---|
bin | 1010000000111100010101… |
… | …1010100001000001100010 |
3 | 1102222200010100111221002011 |
4 | 2200033011122201001202 |
5 | 2420402132142222320 |
6 | 35230305533343134 |
7 | 2214353415150631 |
oct | 240170532410142 |
9 | 42880110457064 |
10 | 11011313242210 |
11 | 3565965296266 |
12 | 129a096637aaa |
13 | 61b493204a08 |
14 | 2a0d43ca5518 |
15 | 1416699c105a |
hex | a03c56a1062 |
11011313242210 has 8 divisors (see below), whose sum is σ = 19820363835996. Its totient is φ = 4404525296880.
The previous prime is 11011313242201. The next prime is 11011313242219. The reversal of 11011313242210 is 1224231311011.
It is an interprime number because it is at equal distance from previous prime (11011313242201) and next prime (11011313242219).
It can be written as a sum of positive squares in 2 ways, for example, as 9691597075689 + 1319716166521 = 3113133^2 + 1148789^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (11011313242219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550565662101 + ... + 550565662120.
Almost surely, 211011313242210 is an apocalyptic number.
11011313242210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011313242210 is a deficient number, since it is larger than the sum of its proper divisors (8809050593786).
11011313242210 is a wasteful number, since it uses less digits than its factorization.
11011313242210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1101131324228.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11011313242210 its reverse (1224231311011), we get a palindrome (12235544553221).
The spelling of 11011313242210 in words is "eleven trillion, eleven billion, three hundred thirteen million, two hundred forty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •