Base | Representation |
---|---|
bin | 10001101000000011000… |
… | …011111001100011100100 |
3 | 11021210101211221111111102 |
4 | 101220003003321203210 |
5 | 124321100411200200 |
6 | 2324233220055232 |
7 | 153336314146352 |
oct | 21500303714344 |
9 | 4253354844442 |
10 | 1211232131300 |
11 | 427753a63634 |
12 | 1768b3234518 |
13 | 8a2ac639749 |
14 | 428a41827d2 |
15 | 21790d2e6d5 |
hex | 11a030f98e4 |
1211232131300 has 72 divisors (see below), whose sum is σ = 2847704672736. Its totient is φ = 445388751360.
The previous prime is 1211232131297. The next prime is 1211232131323. The reversal of 1211232131300 is 31312321121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8211662 + ... + 8357861.
It is an arithmetic number, because the mean of its divisors is an integer number (39551453788).
Almost surely, 21211232131300 is an apocalyptic number.
1211232131300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1211232131300 is an abundant number, since it is smaller than the sum of its proper divisors (1636472541436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211232131300 is a wasteful number, since it uses less digits than its factorization.
1211232131300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16569597 (or 16569590 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1211232131300 its reverse (31312321121), we get a palindrome (1242544452421).
The spelling of 1211232131300 in words is "one trillion, two hundred eleven billion, two hundred thirty-two million, one hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •