Base | Representation |
---|---|
bin | 10001100001000… |
… | …11101010010100 |
3 | 101020111122222200 |
4 | 20300203222110 |
5 | 300104243313 |
6 | 22325324500 |
7 | 3433012026 |
oct | 1060435224 |
9 | 336448880 |
10 | 146946708 |
11 | 75a47267 |
12 | 41266730 |
13 | 245a021c |
14 | 15732016 |
15 | cd79b73 |
hex | 8c23a94 |
146946708 has 36 divisors (see below), whose sum is σ = 393300180. Its totient is φ = 46100736.
The previous prime is 146946673. The next prime is 146946713. The reversal of 146946708 is 807649641.
It can be written as a sum of positive squares in 2 ways, for example, as 137874564 + 9072144 = 11742^2 + 3012^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 119443 + ... + 120666.
It is an arithmetic number, because the mean of its divisors is an integer number (10925005).
Almost surely, 2146946708 is an apocalyptic number.
146946708 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
146946708 is an abundant number, since it is smaller than the sum of its proper divisors (246353472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146946708 is a wasteful number, since it uses less digits than its factorization.
146946708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240136 (or 240131 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
The square root of 146946708 is about 12122.1577287214. The cubic root of 146946708 is about 527.6994243088.
The spelling of 146946708 in words is "one hundred forty-six million, nine hundred forty-six thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •