Base | Representation |
---|---|
bin | 11110101101000101110… |
… | …011100111011101010000 |
3 | 21110201021112102222011022 |
4 | 132231011303213131100 |
5 | 234032240011214300 |
6 | 4253153132535012 |
7 | 305304524636405 |
oct | 36550563473520 |
9 | 7421245388138 |
10 | 2110000101200 |
11 | 74393405aa32 |
12 | 2a0b22921468 |
13 | 123c83a98354 |
14 | 741a5a9c2ac |
15 | 39d450e5285 |
hex | 1eb45ce7750 |
2110000101200 has 30 divisors (see below), whose sum is σ = 5069275244094. Its totient is φ = 844000040320.
The previous prime is 2110000101149. The next prime is 2110000101247. The reversal of 2110000101200 is 21010000112.
It can be written as a sum of positive squares in 3 ways, for example, as 4738394896 + 2105261706304 = 68836^2 + 1450952^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2637499727 + ... + 2637500526.
Almost surely, 22110000101200 is an apocalyptic number.
2110000101200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2110000101200 is an abundant number, since it is smaller than the sum of its proper divisors (2959275142894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110000101200 is a wasteful number, since it uses less digits than its factorization.
2110000101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5275000271 (or 5275000260 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2110000101200 its reverse (21010000112), we get a palindrome (2131010101312).
The spelling of 2110000101200 in words is "two trillion, one hundred ten billion, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •