Base | Representation |
---|---|
bin | 1000101011110000… |
… | …01000100110100100 |
3 | 110000220101100101201 |
4 | 10111320020212210 |
5 | 34021433113012 |
6 | 2050334532244 |
7 | 223346244532 |
oct | 42570104644 |
9 | 13026340351 |
10 | 4662004132 |
11 | 1a82641785 |
12 | aa1367084 |
13 | 593b19536 |
14 | 32323b152 |
15 | 1c443e857 |
hex | 115e089a4 |
4662004132 has 12 divisors (see below), whose sum is σ = 8159012316. Its totient is φ = 2330857760.
The previous prime is 4662004093. The next prime is 4662004133. The reversal of 4662004132 is 2314002664.
It can be written as a sum of positive squares in 2 ways, for example, as 255168676 + 4406835456 = 15974^2 + 66384^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 4662004132.
It is not an unprimeable number, because it can be changed into a prime (4662004133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 73782 + ... + 121522.
It is an arithmetic number, because the mean of its divisors is an integer number (679917693).
Almost surely, 24662004132 is an apocalyptic number.
It is an amenable number.
4662004132 is a deficient number, since it is larger than the sum of its proper divisors (3497008184).
4662004132 is a wasteful number, since it uses less digits than its factorization.
4662004132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72158 (or 72156 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 4662004132 is about 68278.8703187157. The cubic root of 4662004132 is about 1670.5425863120.
Adding to 4662004132 its reverse (2314002664), we get a palindrome (6976006796).
The spelling of 4662004132 in words is "four billion, six hundred sixty-two million, four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •