Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …0101001010100000101000 |
3 | 1110100002212212000112022101 |
4 | 2201223000111022200220 |
5 | 2424011301110413000 |
6 | 35343511422503144 |
7 | 2224446313361236 |
oct | 241530025124050 |
9 | 43302785015271 |
10 | 11110012201000 |
11 | 35a3803282899 |
12 | 12b5240734ab4 |
13 | 62789230358b |
14 | 2a5a28213956 |
15 | 143ee48b1e6a |
hex | a1ac054a828 |
11110012201000 has 64 divisors (see below), whose sum is σ = 26893891674000. Its totient is φ = 4290763321600.
The previous prime is 11110012200979. The next prime is 11110012201031. The reversal of 11110012201000 is 10221001111.
It can be written as a sum of positive squares in 8 ways, for example, as 49558773924 + 11060453427076 = 222618^2 + 3325726^2 .
It is a super-2 number, since 2×111100122010002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191522935 + ... + 191580934.
Almost surely, 211110012201000 is an apocalyptic number.
11110012201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110012201000 is an abundant number, since it is smaller than the sum of its proper divisors (15783879473000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110012201000 is a wasteful number, since it uses less digits than its factorization.
11110012201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383103919 (or 383103905 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11110012201000 its reverse (10221001111), we get a palindrome (11120233202111).
The spelling of 11110012201000 in words is "eleven trillion, one hundred ten billion, twelve million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •