Base | Representation |
---|---|
bin | 11011110101001… |
… | …111000101001000 |
3 | 1012112122000120200 |
4 | 123311033011020 |
5 | 1424014041412 |
6 | 114200052200 |
7 | 14366632533 |
oct | 3365170510 |
9 | 1175560520 |
10 | 466940232 |
11 | 21a637120 |
12 | 110464060 |
13 | 7597b4c5 |
14 | 4602ba1a |
15 | 2aed79dc |
hex | 1bd4f148 |
466940232 has 96 divisors (see below), whose sum is σ = 1388443680. Its totient is φ = 140590080.
The previous prime is 466940231. The next prime is 466940239. The reversal of 466940232 is 232049664.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (466940231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 127288 + ... + 130904.
It is an arithmetic number, because the mean of its divisors is an integer number (14462955).
Almost surely, 2466940232 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 466940232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (694221840).
466940232 is an abundant number, since it is smaller than the sum of its proper divisors (921503448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466940232 is a wasteful number, since it uses less digits than its factorization.
466940232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3803 (or 3796 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The square root of 466940232 is about 21608.7998741254. The cubic root of 466940232 is about 775.8071269338.
Adding to 466940232 its reverse (232049664), we get a palindrome (698989896).
The spelling of 466940232 in words is "four hundred sixty-six million, nine hundred forty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •