Base | Representation |
---|---|
bin | 10001011010101… |
… | …10100001000000 |
3 | 101011220222100100 |
4 | 20231112201000 |
5 | 244400401212 |
6 | 22255322400 |
7 | 3422612163 |
oct | 1055264100 |
9 | 334828310 |
10 | 146106432 |
11 | 75522a1a |
12 | 40b20400 |
13 | 24367914 |
14 | 15593ada |
15 | cc60bdc |
hex | 8b56840 |
146106432 has 168 divisors, whose sum is σ = 455042016. Its totient is φ = 44642304.
The previous prime is 146106421. The next prime is 146106439. The reversal of 146106432 is 234601641.
146106432 is a `hidden beast` number, since 1 + 4 + 6 + 10 + 643 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 146106396 and 146106405.
It is not an unprimeable number, because it can be changed into a prime (146106439) 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, 420883 + ... + 421229.
Almost surely, 2146106432 is an apocalyptic number.
146106432 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 146106432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (227521008).
146106432 is an abundant number, since it is smaller than the sum of its proper divisors (308935584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146106432 is a wasteful number, since it uses less digits than its factorization.
146106432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 425 (or 412 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 146106432 is about 12087.4493587357. The cubic root of 146106432 is about 526.6916643229.
The spelling of 146106432 in words is "one hundred forty-six million, one hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •