Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …101000011011000000000 |
3 | 10220021110001201110120021 |
4 | 100001211331003120000 |
5 | 121020300331144300 |
6 | 2201521112023224 |
7 | 142363211446162 |
oct | 20014575033000 |
9 | 3807401643507 |
10 | 1101222131200 |
11 | 395031203284 |
12 | 159511091b14 |
13 | 7caca04ac29 |
14 | 3b429918932 |
15 | 1d9a2e0dd1a |
hex | 10065f43600 |
1101222131200 has 60 divisors (see below), whose sum is σ = 2728363894740. Its totient is φ = 440488847360.
The previous prime is 1101222131171. The next prime is 1101222131201. The reversal of 1101222131200 is 21312221011.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101222131201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 43003690 + ... + 43029289.
It is an arithmetic number, because the mean of its divisors is an integer number (45472731579).
Almost surely, 21101222131200 is an apocalyptic number.
1101222131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101222131200 is an abundant number, since it is smaller than the sum of its proper divisors (1627141763540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101222131200 is an frugal number, since it uses more digits than its factorization.
1101222131200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86033007 (or 86032986 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1101222131200 its reverse (21312221011), we get a palindrome (1122534352211).
The spelling of 1101222131200 in words is "one trillion, one hundred one billion, two hundred twenty-two million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •