Base | Representation |
---|---|
bin | 10001101101010011010010 |
3 | 22201211122000 |
4 | 101231103102 |
5 | 2142021002 |
6 | 243254430 |
7 | 54312351 |
oct | 21552322 |
9 | 8654560 |
10 | 4642002 |
11 | 2690672 |
12 | 167a416 |
13 | c66b61 |
14 | 88b998 |
15 | 61a61c |
hex | 46d4d2 |
4642002 has 64 divisors (see below), whose sum is σ = 11059200. Its totient is φ = 1440720.
The previous prime is 4641991. The next prime is 4642009. The reversal of 4642002 is 2002464.
4642002 is a `hidden beast` number, since 464 + 200 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (4642009) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 78649 + ... + 78707.
It is an arithmetic number, because the mean of its divisors is an integer number (172800).
Almost surely, 24642002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4642002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5529600).
4642002 is an abundant number, since it is smaller than the sum of its proper divisors (6417198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4642002 is a wasteful number, since it uses less digits than its factorization.
4642002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 142 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 4642002 is about 2154.5305753226. The cubic root of 4642002 is about 166.8150030498.
Adding to 4642002 its reverse (2002464), we get a palindrome (6644466).
The spelling of 4642002 in words is "four million, six hundred forty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •