Base | Representation |
---|---|
bin | 10000101110011100101… |
… | …001110111111000000000 |
3 | 11001212202120200211001022 |
4 | 100232130221313320000 |
5 | 122312414412143441 |
6 | 2240004150325012 |
7 | 146016550653644 |
oct | 20563451677000 |
9 | 4055676624038 |
10 | 1149384490496 |
11 | 4034a6642700 |
12 | 166912659768 |
13 | 8450417bb98 |
14 | 3d8b8174c24 |
15 | 1ed712b284b |
hex | 10b9ca77e00 |
1149384490496 has 240 divisors, whose sum is σ = 2599811018112. Its totient is φ = 506975293440.
The previous prime is 1149384490459. The next prime is 1149384490523. The reversal of 1149384490496 is 6940944839411.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 434220245 + ... + 434222891.
Almost surely, 21149384490496 is an apocalyptic number.
1149384490496 is a gapful number since it is divisible by the number (16) 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 1149384490496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1299905509056).
1149384490496 is an abundant number, since it is smaller than the sum of its proper divisors (1450426527616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1149384490496 is a wasteful number, since it uses less digits than its factorization.
1149384490496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2893 (or 2866 counting only the distinct ones).
The product of its (nonzero) digits is 26873856, while the sum is 62.
The spelling of 1149384490496 in words is "one trillion, one hundred forty-nine billion, three hundred eighty-four million, four hundred ninety thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •