Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …100101000100001010000 |
3 | 10220021110001111212200012 |
4 | 100001211330220201100 |
5 | 121020300314134300 |
6 | 2201521105414052 |
7 | 142363210510400 |
oct | 20014574504120 |
9 | 3807401455605 |
10 | 1101222021200 |
11 | 395031138674 |
12 | 15951103a328 |
13 | 7caca00cb42 |
14 | 3b4298ca800 |
15 | 1d9a2ddb435 |
hex | 10065f28850 |
1101222021200 has 90 divisors (see below), whose sum is σ = 3077634680046. Its totient is φ = 377561829120.
The previous prime is 1101222021187. The next prime is 1101222021209. The reversal of 1101222021200 is 21202221011.
It can be written as a sum of positive squares in 3 ways, for example, as 224422007824 + 876800013376 = 473732^2 + 936376^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101222021209) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 28072799 + ... + 28111998.
Almost surely, 21101222021200 is an apocalyptic number.
1101222021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101222021200 is an abundant number, since it is smaller than the sum of its proper divisors (1976412658846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101222021200 is a wasteful number, since it uses less digits than its factorization.
1101222021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56184829 (or 56184811 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1101222021200 its reverse (21202221011), we get a palindrome (1122424242211).
The spelling of 1101222021200 in words is "one trillion, one hundred one billion, two hundred twenty-two million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •