Base | Representation |
---|---|
bin | 10001101000000111000… |
… | …111010011000110000000 |
3 | 11021210120120220020211020 |
4 | 101220013013103012000 |
5 | 124321220313144300 |
6 | 2324244045345440 |
7 | 153341101142655 |
oct | 21500707230600 |
9 | 4253516806736 |
10 | 1211300131200 |
11 | 4277893889a5 |
12 | 176911b68280 |
13 | 8a2c0757a83 |
14 | 428ad203c2c |
15 | 21796cb28a0 |
hex | 11a071d3180 |
1211300131200 has 192 divisors, whose sum is σ = 4055127010320. Its totient is φ = 317717913600.
The previous prime is 1211300131163. The next prime is 1211300131213. The reversal of 1211300131200 is 21310031121.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1211300131200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 448639 + ... + 1619838.
Almost surely, 21211300131200 is an apocalyptic number.
1211300131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211300131200 is an abundant number, since it is smaller than the sum of its proper divisors (2843826879120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211300131200 is a wasteful number, since it uses less digits than its factorization.
1211300131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2068565 (or 2068548 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1211300131200 its reverse (21310031121), we get a palindrome (1232610162321).
The spelling of 1211300131200 in words is "one trillion, two hundred eleven billion, three hundred million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •