Base | Representation |
---|---|
bin | 10000010011011110110… |
… | …101101100010111111100 |
3 | 10222010000200221002212202 |
4 | 100103132311230113330 |
5 | 121324120102124200 |
6 | 2214415105451032 |
7 | 143643205556000 |
oct | 20233665542774 |
9 | 3863020832782 |
10 | 1120430114300 |
11 | 3a2198654282 |
12 | 161191940a78 |
13 | 8186b6094c3 |
14 | 3c32c952700 |
15 | 1e22937d1d5 |
hex | 104ded6c5fc |
1120430114300 has 72 divisors (see below), whose sum is σ = 2835374253600. Its totient is φ = 384147456000.
The previous prime is 1120430114291. The next prime is 1120430114333. The reversal of 1120430114300 is 34110340211.
It is a super-2 number, since 2×11204301143002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16298501 + ... + 16367100.
Almost surely, 21120430114300 is an apocalyptic number.
1120430114300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1120430114300 is an abundant number, since it is smaller than the sum of its proper divisors (1714944139300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120430114300 is a wasteful number, since it uses less digits than its factorization.
1120430114300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32665636 (or 32665615 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1120430114300 its reverse (34110340211), we get a palindrome (1154540454511).
The spelling of 1120430114300 in words is "one trillion, one hundred twenty billion, four hundred thirty million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •