Base | Representation |
---|---|
bin | 10001100001000… |
… | …11101101000000 |
3 | 101020111200020001 |
4 | 20300203231000 |
5 | 300104300010 |
6 | 22325325344 |
7 | 3433012363 |
oct | 1060435500 |
9 | 336450201 |
10 | 146946880 |
11 | 75a47403 |
12 | 41266854 |
13 | 245a0322 |
14 | 157320da |
15 | cd79c3a |
hex | 8c23b40 |
146946880 has 28 divisors (see below), whose sum is σ = 349918020. Its totient is φ = 58778624.
The previous prime is 146946859. The next prime is 146946887. The reversal of 146946880 is 88649641.
It can be written as a sum of positive squares in 2 ways, for example, as 30824704 + 116122176 = 5552^2 + 10776^2 .
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 146946880.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146946887) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229285 + ... + 229924.
Almost surely, 2146946880 is an apocalyptic number.
146946880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146946880 is an abundant number, since it is smaller than the sum of its proper divisors (202971140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146946880 is an equidigital number, since it uses as much as digits as its factorization.
146946880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459226 (or 459216 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 46.
The square root of 146946880 is about 12122.1648231659. The cubic root of 146946880 is about 527.6996301981.
The spelling of 146946880 in words is "one hundred forty-six million, nine hundred forty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •