Base | Representation |
---|---|
bin | 10000011100100111100… |
… | …011110011011101000000 |
3 | 11000001100101010210222200 |
4 | 100130213203303131000 |
5 | 122004212431033224 |
6 | 2223120343433200 |
7 | 144441255205632 |
oct | 20344743633500 |
9 | 4001311123880 |
10 | 1130240096064 |
11 | 3a6372083822 |
12 | 16306b155800 |
13 | 82772b25b41 |
14 | 3c9bd770a52 |
15 | 1e6007045c9 |
hex | 107278f3740 |
1130240096064 has 168 divisors, whose sum is σ = 3382666803360. Its totient is φ = 360355279872.
The previous prime is 1130240096039. The next prime is 1130240096077. The reversal of 1130240096064 is 4606900420311.
1130240096064 is a `hidden beast` number, since 1 + 1 + 3 + 0 + 2 + 40 + 0 + 9 + 606 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 1471147 + ... + 2103509.
Almost surely, 21130240096064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1130240096064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1691333401680).
1130240096064 is an abundant number, since it is smaller than the sum of its proper divisors (2252426707296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130240096064 is a wasteful number, since it uses less digits than its factorization.
1130240096064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632517 (or 632504 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The spelling of 1130240096064 in words is "one trillion, one hundred thirty billion, two hundred forty million, ninety-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •