Base | Representation |
---|---|
bin | 10001011011001… |
… | …10110011001100 |
3 | 101012001100211201 |
4 | 20231212303030 |
5 | 244410020012 |
6 | 22300555244 |
7 | 3423310510 |
oct | 1055466314 |
9 | 335040751 |
10 | 146173132 |
11 | 75569046 |
12 | 40b52b24 |
13 | 2438c0a1 |
14 | 155b0140 |
15 | cc75857 |
hex | 8b66ccc |
146173132 has 12 divisors (see below), whose sum is σ = 292346320. Its totient is φ = 62645616.
The previous prime is 146173129. The next prime is 146173133. The reversal of 146173132 is 231371641.
146173132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
146173132 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 5220469 = 146173132 / (1 + 4 + 6 + 1 + 7 + 3 + 1 + 3 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 146173132.
It is not an unprimeable number, because it can be changed into a prime (146173133) 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, 2610207 + ... + 2610262.
Almost surely, 2146173132 is an apocalyptic number.
It is an amenable number.
146173132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146173132 is a wasteful number, since it uses less digits than its factorization.
146173132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5220480 (or 5220478 counting only the distinct ones).
The product of its digits is 3024, while the sum is 28.
The square root of 146173132 is about 12090.2081040816. The cubic root of 146173132 is about 526.7717999451.
The spelling of 146173132 in words is "one hundred forty-six million, one hundred seventy-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •