Base | Representation |
---|---|
bin | 1111001000001000… |
… | …1100100111011000 |
3 | 101110222212000101111 |
4 | 3302002030213120 |
5 | 31304012142412 |
6 | 1510534030104 |
7 | 202425026254 |
oct | 36202144730 |
9 | 11428760344 |
10 | 4060662232 |
11 | 17a4157700 |
12 | 953aa8334 |
13 | 4c9370c23 |
14 | 2a7425264 |
15 | 18b7592a7 |
hex | f208c9d8 |
4060662232 has 48 divisors (see below), whose sum is σ = 8443111320. Its totient is φ = 1829372160.
The previous prime is 4060662227. The next prime is 4060662239. The reversal of 4060662232 is 2322660604.
It is a Smith number, since the sum of its digits (31) 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 = 4060662194 and 4060662203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4060662239) 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, 90823 + ... + 127945.
Almost surely, 24060662232 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 4060662232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4221555660).
4060662232 is an abundant number, since it is smaller than the sum of its proper divisors (4382449088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4060662232 is a wasteful number, since it uses less digits than its factorization.
4060662232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37264 (or 37249 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
The square root of 4060662232 is about 63723.3256508164. The cubic root of 4060662232 is about 1595.3854320212.
The spelling of 4060662232 in words is "four billion, sixty million, six hundred sixty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •