Base | Representation |
---|---|
bin | 1010000000111111010011… |
… | …1010101011000101110000 |
3 | 1102222202011220010122021210 |
4 | 2200033310322223011300 |
5 | 2420410300202414300 |
6 | 35230521003120120 |
7 | 2214412233200343 |
oct | 240176472530560 |
9 | 42882156118253 |
10 | 11012110201200 |
11 | 356623413a359 |
12 | 129a279513040 |
13 | 61b58c361694 |
14 | 2a0dbba7c45a |
15 | 1416b4947050 |
hex | a03f4eab170 |
11012110201200 has 60 divisors (see below), whose sum is σ = 35275459681688. Its totient is φ = 2936562720000.
The previous prime is 11012110201181. The next prime is 11012110201207. The reversal of 11012110201200 is 210201121011.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012110201207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4588378051 + ... + 4588380450.
Almost surely, 211012110201200 is an apocalyptic number.
11012110201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012110201200 is an abundant number, since it is smaller than the sum of its proper divisors (24263349480488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012110201200 is a wasteful number, since it uses less digits than its factorization.
11012110201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9176758522 (or 9176758511 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012110201200 its reverse (210201121011), we get a palindrome (11222311322211).
The spelling of 11012110201200 in words is "eleven trillion, twelve billion, one hundred ten million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •