Base | Representation |
---|---|
bin | 10001100000111… |
… | …00011011000000 |
3 | 101020110011022110 |
4 | 20300130123000 |
5 | 300102321211 |
6 | 22324535320 |
7 | 3432526416 |
oct | 1060343300 |
9 | 336404273 |
10 | 146917056 |
11 | 75a26a60 |
12 | 41251540 |
13 | 2458c890 |
14 | 157252b6 |
15 | cd70ea6 |
hex | 8c1c6c0 |
146917056 has 112 divisors (see below), whose sum is σ = 456761088. Its totient is φ = 41088000.
The previous prime is 146917051. The next prime is 146917079. The reversal of 146917056 is 650719641.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (146917051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24781 + ... + 30131.
It is an arithmetic number, because the mean of its divisors is an integer number (4078224).
Almost surely, 2146917056 is an apocalyptic number.
146917056 is a gapful number since it is divisible by the number (16) 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 146917056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228380544).
146917056 is an abundant number, since it is smaller than the sum of its proper divisors (309844032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146917056 is a wasteful number, since it uses less digits than its factorization.
146917056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5390 (or 5380 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 39.
The square root of 146917056 is about 12120.9346174295. The cubic root of 146917056 is about 527.6639275491.
The spelling of 146917056 in words is "one hundred forty-six million, nine hundred seventeen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •