Base | Representation |
---|---|
bin | 10000001011110001010… |
… | …100110011100010011000 |
3 | 10221022122200001020202121 |
4 | 100023301110303202120 |
5 | 121210140440403100 |
6 | 2210525333111024 |
7 | 143231056534522 |
oct | 20136124634230 |
9 | 3838580036677 |
10 | 1112150325400 |
11 | 399729957334 |
12 | 15b660a88474 |
13 | 80b4c123b2a |
14 | 3bb85056a12 |
15 | 1dde251751a |
hex | 102f1533898 |
1112150325400 has 24 divisors (see below), whose sum is σ = 2585749507020. Its totient is φ = 444860130080.
The previous prime is 1112150325397. The next prime is 1112150325401. The reversal of 1112150325400 is 45230512111.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112150325401) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 2780375614 + ... + 2780376013.
Almost surely, 21112150325400 is an apocalyptic number.
1112150325400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112150325400 is an abundant number, since it is smaller than the sum of its proper divisors (1473599181620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112150325400 is a wasteful number, since it uses less digits than its factorization.
1112150325400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5560751643 (or 5560751634 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 1112150325400 its reverse (45230512111), we get a palindrome (1157380837511).
The spelling of 1112150325400 in words is "one trillion, one hundred twelve billion, one hundred fifty million, three hundred twenty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •