Base | Representation |
---|---|
bin | 10000101000100110010… |
… | …100101010000010010000 |
3 | 11001021112220022112200110 |
4 | 100220212110222002100 |
5 | 122212034142000000 |
6 | 2233045043121320 |
7 | 145405121543616 |
oct | 20504624520220 |
9 | 4037486275613 |
10 | 1143104250000 |
11 | 400873603aa9 |
12 | 16565b373240 |
13 | 83a4301314b |
14 | 3d4800576b6 |
15 | 1eb04c70850 |
hex | 10a2652a090 |
1143104250000 has 140 divisors (see below), whose sum is σ = 3691229314160. Its totient is φ = 304827600000.
The previous prime is 1143104249993. The next prime is 1143104250019. The reversal of 1143104250000 is 524013411.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 12070 + ... + 1512069.
Almost surely, 21143104250000 is an apocalyptic number.
1143104250000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1143104250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1845614657080).
1143104250000 is an abundant number, since it is smaller than the sum of its proper divisors (2548125064160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1143104250000 is an frugal number, since it uses more digits than its factorization.
1143104250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524180 (or 1524149 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 1143104250000 its reverse (524013411), we get a palindrome (1143628263411).
The spelling of 1143104250000 in words is "one trillion, one hundred forty-three billion, one hundred four million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •