Base | Representation |
---|---|
bin | 11110010001001011101… |
… | …10000011001000101000 |
3 | 10200102110120111020000110 |
4 | 33020211312003020220 |
5 | 114014423323324430 |
6 | 2113435513534320 |
7 | 135065406510204 |
oct | 17104566031050 |
9 | 3612416436013 |
10 | 1040017011240 |
11 | 371083542809 |
12 | 14968b7143a0 |
13 | 770c4a2600c |
14 | 384a0da1b04 |
15 | 1c0be9ad7b0 |
hex | f225d83228 |
1040017011240 has 128 divisors (see below), whose sum is σ = 3231312134400. Its totient is φ = 267469762560.
The previous prime is 1040017011179. The next prime is 1040017011251. The reversal of 1040017011240 is 421107100401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2896269 + ... + 3235491.
It is an arithmetic number, because the mean of its divisors is an integer number (25244626050).
Almost surely, 21040017011240 is an apocalyptic number.
1040017011240 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 1040017011240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1615656067200).
1040017011240 is an abundant number, since it is smaller than the sum of its proper divisors (2191295123160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040017011240 is a wasteful number, since it uses less digits than its factorization.
1040017011240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340147 (or 340143 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 21.
The spelling of 1040017011240 in words is "one trillion, forty billion, seventeen million, eleven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •