Base | Representation |
---|---|
bin | 10001011111000… |
… | …11110010110001 |
3 | 101020000101010200 |
4 | 20233203302301 |
5 | 300022410410 |
6 | 22315545413 |
7 | 3430542240 |
oct | 1057436261 |
9 | 336011120 |
10 | 146685105 |
11 | 75888766 |
12 | 4115b269 |
13 | 2450b128 |
14 | 156a4957 |
15 | cd273c0 |
hex | 8be3cb1 |
146685105 has 48 divisors (see below), whose sum is σ = 294602880. Its totient is φ = 66127104.
The previous prime is 146685101. The next prime is 146685107. The reversal of 146685105 is 501586641.
It is not a de Polignac number, because 146685105 - 22 = 146685101 is a prime.
It is a super-2 number, since 2×1466851052 = 43033040057722050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 146685105.
It is not an unprimeable number, because it can be changed into a prime (146685101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19806 + ... + 26184.
It is an arithmetic number, because the mean of its divisors is an integer number (6137560).
Almost surely, 2146685105 is an apocalyptic number.
146685105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
146685105 is an abundant number, since it is smaller than the sum of its proper divisors (147917775).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146685105 is a wasteful number, since it uses less digits than its factorization.
146685105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6470 (or 6467 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 146685105 is about 12111.3626400996. The cubic root of 146685105 is about 527.3860913196.
The spelling of 146685105 in words is "one hundred forty-six million, six hundred eighty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •