Base | Representation |
---|---|
bin | 101100001001011… |
… | …010001101000100 |
3 | 1220121200122011220 |
4 | 230021122031010 |
5 | 3004102223012 |
6 | 201255000340 |
7 | 24232353435 |
oct | 5411321504 |
9 | 1817618156 |
10 | 740664132 |
11 | 3500a3a1a |
12 | 1880690b0 |
13 | ba5a9300 |
14 | 7052148c |
15 | 4505608c |
hex | 2c25a344 |
740664132 has 72 divisors (see below), whose sum is σ = 1897396704. Its totient is φ = 224729856.
The previous prime is 740664097. The next prime is 740664151. The reversal of 740664132 is 231466047.
It is a happy number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 740664093 and 740664102.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145543 + ... + 150545.
It is an arithmetic number, because the mean of its divisors is an integer number (26352732).
Almost surely, 2740664132 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 740664132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (948698352).
740664132 is an abundant number, since it is smaller than the sum of its proper divisors (1156732572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
740664132 is a wasteful number, since it uses less digits than its factorization.
740664132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5109 (or 5094 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 33.
The square root of 740664132 is about 27215.1452687653. The cubic root of 740664132 is about 904.7746789056.
The spelling of 740664132 in words is "seven hundred forty million, six hundred sixty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •