Base | Representation |
---|---|
bin | 100001111110111… |
… | …0111011000000000 |
3 | 2221110122210021200 |
4 | 1003331313120000 |
5 | 4313403303242 |
6 | 305052221200 |
7 | 40154212524 |
oct | 10375673000 |
9 | 2843583250 |
10 | 1140291072 |
11 | 535734618 |
12 | 279a6a800 |
13 | 152319b5b |
14 | ab629d84 |
15 | 6a19404c |
hex | 43f77600 |
1140291072 has 120 divisors (see below), whose sum is σ = 3317834520. Its totient is φ = 376995840.
The previous prime is 1140291059. The next prime is 1140291077. The reversal of 1140291072 is 2701920411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140291077) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 602704 + ... + 604592.
It is an arithmetic number, because the mean of its divisors is an integer number (27648621).
Almost surely, 21140291072 is an apocalyptic number.
1140291072 is a gapful number since it is divisible by the number (12) 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 1140291072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1658917260).
1140291072 is an abundant number, since it is smaller than the sum of its proper divisors (2177543448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140291072 is a wasteful number, since it uses less digits than its factorization.
1140291072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2044 (or 2025 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 1140291072 is about 33768.1961614771. The cubic root of 1140291072 is about 1044.7328276182.
The spelling of 1140291072 in words is "one billion, one hundred forty million, two hundred ninety-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •