Base | Representation |
---|---|
bin | 10001100000011… |
… | …01110001001000 |
3 | 101020100002222100 |
4 | 20300031301020 |
5 | 300043411112 |
6 | 22323353400 |
7 | 3432156420 |
oct | 1060156110 |
9 | 336302870 |
10 | 146857032 |
11 | 75995953 |
12 | 41222860 |
13 | 2456b46a |
14 | 1570b480 |
15 | cd5d2dc |
hex | 8c0dc48 |
146857032 has 96 divisors (see below), whose sum is σ = 461448000. Its totient is φ = 41323392.
The previous prime is 146857021. The next prime is 146857037. The reversal of 146857032 is 230758641.
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 (146857037) 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, 31594 + ... + 35942.
It is an arithmetic number, because the mean of its divisors is an integer number (4806750).
Almost surely, 2146857032 is an apocalyptic number.
146857032 is a gapful number since it is divisible by the number (12) 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 146857032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (230724000).
146857032 is an abundant number, since it is smaller than the sum of its proper divisors (314590968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146857032 is a wasteful number, since it uses less digits than its factorization.
146857032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4435 (or 4428 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 146857032 is about 12118.4583177894. The cubic root of 146857032 is about 527.5920574868.
The spelling of 146857032 in words is "one hundred forty-six million, eight hundred fifty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •