Base | Representation |
---|---|
bin | 10001011110011… |
… | …11011010100000 |
3 | 101012212010122002 |
4 | 20233033122200 |
5 | 300012223012 |
6 | 22314103132 |
7 | 3430044002 |
oct | 1057173240 |
9 | 335763562 |
10 | 146601632 |
11 | 75830a81 |
12 | 4111aaa8 |
13 | 244ac138 |
14 | 15682372 |
15 | cd0c7c2 |
hex | 8bcf6a0 |
146601632 has 48 divisors (see below), whose sum is σ = 303549120. Its totient is φ = 69560832.
The previous prime is 146601617. The next prime is 146601649. The reversal of 146601632 is 236106641.
It is a happy number.
146601632 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 146601595 and 146601604.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101588 + ... + 103020.
It is an arithmetic number, because the mean of its divisors is an integer number (6323940).
Almost surely, 2146601632 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 146601632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151774560).
146601632 is an abundant number, since it is smaller than the sum of its proper divisors (156947488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146601632 is a wasteful number, since it uses less digits than its factorization.
146601632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1605 (or 1597 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 146601632 is about 12107.9160882457. The cubic root of 146601632 is about 527.2860337794.
The spelling of 146601632 in words is "one hundred forty-six million, six hundred one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •