Base | Representation |
---|---|
bin | 10001011010010… |
… | …00001000001100 |
3 | 101011210222111200 |
4 | 20231020020030 |
5 | 244342010000 |
6 | 22254145500 |
7 | 3422245314 |
oct | 1055101014 |
9 | 334728450 |
10 | 146047500 |
11 | 75492715 |
12 | 40ab2290 |
13 | 24346b51 |
14 | 1557a444 |
15 | cc4d500 |
hex | 8b4820c |
146047500 has 90 divisors (see below), whose sum is σ = 461392932. Its totient is φ = 38940000.
The previous prime is 146047483. The next prime is 146047501. The reversal of 146047500 is 5740641.
146047500 is a `hidden beast` number, since 1 + 4 + 604 + 7 + 50 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (90).
It is not an unprimeable number, because it can be changed into a prime (146047501) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 19255 + ... + 25745.
Almost surely, 2146047500 is an apocalyptic number.
146047500 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 146047500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (230696466).
146047500 is an abundant number, since it is smaller than the sum of its proper divisors (315345432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146047500 is a wasteful number, since it uses less digits than its factorization.
146047500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6521 (or 6501 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 146047500 is about 12085.0113777356. The cubic root of 146047500 is about 526.6208411409.
The spelling of 146047500 in words is "one hundred forty-six million, forty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •