Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …010111110010000101000 |
3 | 10220021102021222000212201 |
4 | 100001211102332100220 |
5 | 121020240020201300 |
6 | 2201520035345544 |
7 | 142363015623631 |
oct | 20014522762050 |
9 | 3807367860781 |
10 | 1101211100200 |
11 | 395025a59552 |
12 | 1595094522b4 |
13 | 7cac7988003 |
14 | 3b428286888 |
15 | 1d9a1e8066a |
hex | 100654be428 |
1101211100200 has 48 divisors (see below), whose sum is σ = 2585665516860. Its totient is φ = 436123200000.
The previous prime is 1101211100189. The next prime is 1101211100203. The reversal of 1101211100200 is 20011121011.
It can be written as a sum of positive squares in 6 ways, for example, as 317593110916 + 783617989284 = 563554^2 + 885222^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (1101211100203) 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, 27237501 + ... + 27277900.
Almost surely, 21101211100200 is an apocalyptic number.
1101211100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101211100200 is an abundant number, since it is smaller than the sum of its proper divisors (1484454416660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101211100200 is a wasteful number, since it uses less digits than its factorization.
1101211100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54515518 (or 54515509 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1101211100200 its reverse (20011121011), we get a palindrome (1121222221211).
The spelling of 1101211100200 in words is "one trillion, one hundred one billion, two hundred eleven million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •