Base | Representation |
---|---|
bin | 10001011110011… |
… | …11011010010100 |
3 | 101012212010121122 |
4 | 20233033122110 |
5 | 300012222440 |
6 | 22314103112 |
7 | 3430043654 |
oct | 1057173224 |
9 | 335763548 |
10 | 146601620 |
11 | 75830a70 |
12 | 4111aa98 |
13 | 244ac129 |
14 | 15682364 |
15 | cd0c7b5 |
hex | 8bcf694 |
146601620 has 48 divisors (see below), whose sum is σ = 343683648. Its totient is φ = 52066560.
The previous prime is 146601617. The next prime is 146601649. The reversal of 146601620 is 26106641.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 146601620.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1712 + ... + 17208.
It is an arithmetic number, because the mean of its divisors is an integer number (7160076).
Almost surely, 2146601620 is an apocalyptic number.
146601620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146601620, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171841824).
146601620 is an abundant number, since it is smaller than the sum of its proper divisors (197082028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146601620 is a wasteful number, since it uses less digits than its factorization.
146601620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15560 (or 15558 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 146601620 is about 12107.9155927022. The cubic root of 146601620 is about 527.2860193925.
The spelling of 146601620 in words is "one hundred forty-six million, six hundred one thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •