Base | Representation |
---|---|
bin | 111110000010010… |
… | …101010110101000 |
3 | 2200112110002000110 |
4 | 332002111112220 |
5 | 4112421033034 |
6 | 251135534320 |
7 | 34535434560 |
oct | 7602252650 |
9 | 2615402013 |
10 | 1040799144 |
11 | 49455a890 |
12 | 25068a3a0 |
13 | 1378236a8 |
14 | 9c32bda0 |
15 | 6158ede9 |
hex | 3e0955a8 |
1040799144 has 128 divisors (see below), whose sum is σ = 3274444800. Its totient is φ = 267805440.
The previous prime is 1040799139. The next prime is 1040799187. The reversal of 1040799144 is 4419970401.
It is a super-2 number, since 2×10407991442 = 2166525716302265472, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 198849 + ... + 204015.
It is an arithmetic number, because the mean of its divisors is an integer number (25581600).
Almost surely, 21040799144 is an apocalyptic number.
1040799144 is a gapful number since it is divisible by the number (14) 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 1040799144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1637222400).
1040799144 is an abundant number, since it is smaller than the sum of its proper divisors (2233645656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040799144 is a wasteful number, since it uses less digits than its factorization.
1040799144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5303 (or 5299 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 39.
The square root of 1040799144 is about 32261.4188156690. The cubic root of 1040799144 is about 1013.4188438728.
The spelling of 1040799144 in words is "one billion, forty million, seven hundred ninety-nine thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •