Base | Representation |
---|---|
bin | 10000001010101111010… |
… | …101001111100101000000 |
3 | 10221012210111200121102002 |
4 | 100022233111033211000 |
5 | 121200404021102000 |
6 | 2210223422243132 |
7 | 143161453621436 |
oct | 20125725174500 |
9 | 3835714617362 |
10 | 1111043144000 |
11 | 399210987589 |
12 | 15b3b21264a8 |
13 | 80a0392a4ca |
14 | 3babbda8d56 |
15 | 1dd7a2138d5 |
hex | 102af54f940 |
1111043144000 has 56 divisors (see below), whose sum is σ = 2751498365928. Its totient is φ = 444417254400.
The previous prime is 1111043143999. The next prime is 1111043144009. The reversal of 1111043144000 is 4413401111.
It can be written as a sum of positive squares in 4 ways, for example, as 2958489664 + 1108084654336 = 54392^2 + 1052656^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111043144009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69432197 + ... + 69448196.
Almost surely, 21111043144000 is an apocalyptic number.
1111043144000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111043144000 is an abundant number, since it is smaller than the sum of its proper divisors (1640455221928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111043144000 is an equidigital number, since it uses as much as digits as its factorization.
1111043144000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138880420 (or 138880400 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1111043144000 its reverse (4413401111), we get a palindrome (1115456545111).
The spelling of 1111043144000 in words is "one trillion, one hundred eleven billion, forty-three million, one hundred forty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •