Base | Representation |
---|---|
bin | 1010000111101000000010… |
… | …1001000010111100100100 |
3 | 1110101122110200100100212021 |
4 | 2201322000221002330210 |
5 | 2424242300111242020 |
6 | 35355134240432524 |
7 | 2225556466451641 |
oct | 241720051027444 |
9 | 43348420310767 |
10 | 11126123540260 |
11 | 35aa620754503 |
12 | 12b8398318744 |
13 | 62925c170611 |
14 | 2a6715c88dc8 |
15 | 14463904c1aa |
hex | a1e80a42f24 |
11126123540260 has 24 divisors (see below), whose sum is σ = 23378627837880. Its totient is φ = 4447826863104.
The previous prime is 11126123540243. The next prime is 11126123540327. The reversal of 11126123540260 is 6204532162111.
It can be written as a sum of positive squares in 4 ways, for example, as 3725949993984 + 7400173546276 = 1930272^2 + 2720326^2 .
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 7 ways as a sum of consecutive naturals, for example, 163874775 + ... + 163942654.
It is an arithmetic number, because the mean of its divisors is an integer number (974109493245).
Almost surely, 211126123540260 is an apocalyptic number.
11126123540260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11126123540260 is an abundant number, since it is smaller than the sum of its proper divisors (12252504297620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11126123540260 is a wasteful number, since it uses less digits than its factorization.
11126123540260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327819135 (or 327819133 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 11126123540260 in words is "eleven trillion, one hundred twenty-six billion, one hundred twenty-three million, five hundred forty thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •