Base | Representation |
---|---|
bin | 100100111101010… |
… | …0000101101000000 |
3 | 10012102102100012101 |
4 | 1021322200231000 |
5 | 10014424400242 |
6 | 323015040144 |
7 | 42505315135 |
oct | 11172405500 |
9 | 3172370171 |
10 | 1240075072 |
11 | 586a98835 |
12 | 2a7370054 |
13 | 169bb6242 |
14 | ba9a258c |
15 | 73d049b7 |
hex | 49ea0b40 |
1240075072 has 56 divisors (see below), whose sum is σ = 2528718336. Its totient is φ = 603084288.
The previous prime is 1240075027. The next prime is 1240075073. The reversal of 1240075072 is 2705700421.
It is a self number, because there is not a number n which added to its sum of digits gives 1240075072.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1240075073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 519193 + ... + 521575.
Almost surely, 21240075072 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 1240075072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1264359168).
1240075072 is an abundant number, since it is smaller than the sum of its proper divisors (1288643264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1240075072 is a wasteful number, since it uses less digits than its factorization.
1240075072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2615 (or 2605 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 28.
The square root of 1240075072 is about 35214.6996579553. The cubic root of 1240075072 is about 1074.3587513667.
Adding to 1240075072 its reverse (2705700421), we get a palindrome (3945775493).
The spelling of 1240075072 in words is "one billion, two hundred forty million, seventy-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •