Base | Representation |
---|---|
bin | 10001011011110… |
… | …00000000100110 |
3 | 101012011221112110 |
4 | 20231320000212 |
5 | 244414243442 |
6 | 22302301450 |
7 | 3424023150 |
oct | 1055700046 |
9 | 335157473 |
10 | 146243622 |
11 | 75606aa8 |
12 | 40b87886 |
13 | 243b51b5 |
14 | 155cbad0 |
15 | cc8b69c |
hex | 8b78026 |
146243622 has 64 divisors (see below), whose sum is σ = 355829760. Its totient is φ = 39115776.
The previous prime is 146243621. The next prime is 146243659. The reversal of 146243622 is 226342641.
It is a self number, because there is not a number n which added to its sum of digits gives 146243622.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146243621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 170218 + ... + 171074.
It is an arithmetic number, because the mean of its divisors is an integer number (5559840).
Almost surely, 2146243622 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146243622, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177914880).
146243622 is an abundant number, since it is smaller than the sum of its proper divisors (209586138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146243622 is a wasteful number, since it uses less digits than its factorization.
146243622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125.
The product of its digits is 13824, while the sum is 30.
The square root of 146243622 is about 12093.1229217270. The cubic root of 146243622 is about 526.8564625103.
The spelling of 146243622 in words is "one hundred forty-six million, two hundred forty-three thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •