Base | Representation |
---|---|
bin | 1010000000111100101111… |
… | …1010111110000111111110 |
3 | 1102222200101221221101200020 |
4 | 2200033023322332013332 |
5 | 2420402343114211220 |
6 | 35230324433313010 |
7 | 2214356212121004 |
oct | 240171372760776 |
9 | 42880357841606 |
10 | 11011422413310 |
11 | 3565a10981110 |
12 | 129a107105766 |
13 | 61b4aca099b7 |
14 | 2a0d545a2a74 |
15 | 141674388040 |
hex | a03cbebe1fe |
11011422413310 has 32 divisors (see below), whose sum is σ = 28829905955712. Its totient is φ = 2669435736480.
The previous prime is 11011422413297. The next prime is 11011422413317. The reversal of 11011422413310 is 1331422411011.
It is a super-2 number, since 2×110114224133102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011422413317) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16683973024 + ... + 16683973683.
It is an arithmetic number, because the mean of its divisors is an integer number (900934561116).
Almost surely, 211011422413310 is an apocalyptic number.
11011422413310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011422413310 is an abundant number, since it is smaller than the sum of its proper divisors (17818483542402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011422413310 is a wasteful number, since it uses less digits than its factorization.
11011422413310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33367946728.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11011422413310 its reverse (1331422411011), we get a palindrome (12342844824321).
The spelling of 11011422413310 in words is "eleven trillion, eleven billion, four hundred twenty-two million, four hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •