Base | Representation |
---|---|
bin | 10001011110110… |
… | …11001001110000 |
3 | 101012221120120211 |
4 | 20233123021300 |
5 | 300020242322 |
6 | 22315113504 |
7 | 3430334116 |
oct | 1057331160 |
9 | 335846524 |
10 | 146649712 |
11 | 75864110 |
12 | 41142894 |
13 | 244c7ca1 |
14 | 15695ab6 |
15 | cd1bb77 |
hex | 8bdb270 |
146649712 has 40 divisors (see below), whose sum is σ = 313729920. Its totient is φ = 65849280.
The previous prime is 146649707. The next prime is 146649731. The reversal of 146649712 is 217946641.
146649712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1466497122 = 43012276059365888, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9589 + ... + 19627.
It is an arithmetic number, because the mean of its divisors is an integer number (7843248).
Almost surely, 2146649712 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146649712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156864960).
146649712 is an abundant number, since it is smaller than the sum of its proper divisors (167080208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146649712 is a wasteful number, since it uses less digits than its factorization.
146649712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10141 (or 10135 counting only the distinct ones).
The product of its digits is 72576, while the sum is 40.
The square root of 146649712 is about 12109.9014033971. The cubic root of 146649712 is about 527.3436710221.
The spelling of 146649712 in words is "one hundred forty-six million, six hundred forty-nine thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •