Base | Representation |
---|---|
bin | 100100111101001… |
… | …0100100001000000 |
3 | 10012102022210201111 |
4 | 1021322110201000 |
5 | 10014421301102 |
6 | 323014013104 |
7 | 42505016452 |
oct | 11172244100 |
9 | 3172283644 |
10 | 1240025152 |
11 | 586a64283 |
12 | 2a7347194 |
13 | 169b995c2 |
14 | ba98c2d2 |
15 | 73ce4cd7 |
hex | 49e94840 |
1240025152 has 56 divisors (see below), whose sum is σ = 2695331160. Its totient is φ = 563404800.
The previous prime is 1240025147. The next prime is 1240025161. The reversal of 1240025152 is 2515200421.
It can be written as a sum of positive squares in 4 ways, for example, as 230310976 + 1009714176 = 15176^2 + 31776^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11902 + ... + 51202.
Almost surely, 21240025152 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 1240025152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1347665580).
1240025152 is an abundant number, since it is smaller than the sum of its proper divisors (1455306008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1240025152 is a wasteful number, since it uses less digits than its factorization.
1240025152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39359 (or 39349 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 1240025152 is about 35213.9908559084. The cubic root of 1240025152 is about 1074.3443348447.
Adding to 1240025152 its reverse (2515200421), we get a palindrome (3755225573).
The spelling of 1240025152 in words is "one billion, two hundred forty million, twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •