Base | Representation |
---|---|
bin | 1010000001001000000001… |
… | …0001100110101111000100 |
3 | 1102222222012211120121101112 |
4 | 2200102000101212233010 |
5 | 2420430042222330300 |
6 | 35231545003344152 |
7 | 2214524203223534 |
oct | 240220021465704 |
9 | 42888184517345 |
10 | 11014448245700 |
11 | 3567223985839 |
12 | 129a810522058 |
13 | 61b872867273 |
14 | 2a11603b14c4 |
15 | 14179ed30e35 |
hex | a0480466bc4 |
11014448245700 has 72 divisors (see below), whose sum is σ = 24041481429000. Its totient is φ = 4379953305600.
The previous prime is 11014448245699. The next prime is 11014448245711. The reversal of 11014448245700 is 754284441011.
It can be written as a sum of positive squares in 12 ways, for example, as 3146905698304 + 7867542547396 = 1773952^2 + 2804914^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 336312926 + ... + 336345674.
Almost surely, 211014448245700 is an apocalyptic number.
11014448245700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11014448245700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12020740714500).
11014448245700 is an abundant number, since it is smaller than the sum of its proper divisors (13027033183300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014448245700 is a wasteful number, since it uses less digits than its factorization.
11014448245700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52377 (or 52370 counting only the distinct ones).
The product of its (nonzero) digits is 143360, while the sum is 41.
The spelling of 11014448245700 in words is "eleven trillion, fourteen billion, four hundred forty-eight million, two hundred forty-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •