Base | Representation |
---|---|
bin | 10001011101010… |
… | …11111111100111 |
3 | 101012120202121201 |
4 | 20232223333213 |
5 | 244443102201 |
6 | 22311023331 |
7 | 3425601013 |
oct | 1056537747 |
9 | 335522551 |
10 | 146456551 |
11 | 75741a7a |
12 | 4106ab47 |
13 | 2445b0a7 |
14 | 15645543 |
15 | ccce801 |
hex | 8babfe7 |
146456551 has 8 divisors (see below), whose sum is σ = 150192000. Its totient is φ = 142728960.
The previous prime is 146456549. The next prime is 146456587. The reversal of 146456551 is 155654641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146456551 - 21 = 146456549 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 146456551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146456851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59850 + ... + 62248.
It is an arithmetic number, because the mean of its divisors is an integer number (18774000).
Almost surely, 2146456551 is an apocalyptic number.
146456551 is a deficient number, since it is larger than the sum of its proper divisors (3735449).
146456551 is a wasteful number, since it uses less digits than its factorization.
146456551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3929.
The product of its digits is 72000, while the sum is 37.
The square root of 146456551 is about 12101.9234421641. The cubic root of 146456551 is about 527.1120374577.
It can be divided in two parts, 1464565 and 51, that added together give a triangular number (1464616 = T1711).
The spelling of 146456551 in words is "one hundred forty-six million, four hundred fifty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •