Base | Representation |
---|---|
bin | 10001011011110… |
… | …01110100110101 |
3 | 101012012022201222 |
4 | 20231321310311 |
5 | 244420013221 |
6 | 22302400125 |
7 | 3424053635 |
oct | 1055716465 |
9 | 335168658 |
10 | 146251061 |
11 | 75611650 |
12 | 40b90045 |
13 | 243b86b8 |
14 | 155d06c5 |
15 | cc8d9ab |
hex | 8b79d35 |
146251061 has 4 divisors (see below), whose sum is σ = 159546624. Its totient is φ = 132955500.
The previous prime is 146251057. The next prime is 146251067. The reversal of 146251061 is 160152641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 146251061 - 22 = 146251057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 146251061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146251067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6647765 + ... + 6647786.
It is an arithmetic number, because the mean of its divisors is an integer number (39886656).
Almost surely, 2146251061 is an apocalyptic number.
146251061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146251061 is a deficient number, since it is larger than the sum of its proper divisors (13295563).
146251061 is a wasteful number, since it uses less digits than its factorization.
146251061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13295562.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 146251061 is about 12093.4304893194. The cubic root of 146251061 is about 526.8653955923.
The spelling of 146251061 in words is "one hundred forty-six million, two hundred fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •