Base | Representation |
---|---|
bin | 10001010110100… |
… | …00010001000111 |
3 | 101010220001001101 |
4 | 20223100101013 |
5 | 244230302201 |
6 | 22235440531 |
7 | 3415132060 |
oct | 1053202107 |
9 | 333801041 |
10 | 145556551 |
11 | 75187878 |
12 | 408b6147 |
13 | 2420454a |
14 | 1548d567 |
15 | cba2d01 |
hex | 8ad0447 |
145556551 has 12 divisors (see below), whose sum is σ = 168429072. Its totient is φ = 123209856.
The previous prime is 145556527. The next prime is 145556569. The reversal of 145556551 is 155655541.
It is not a de Polignac number, because 145556551 - 211 = 145554503 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145556551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145556051) by changing a digit.
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, 314146 + ... + 314608.
It is an arithmetic number, because the mean of its divisors is an integer number (14035756).
Almost surely, 2145556551 is an apocalyptic number.
145556551 is a deficient number, since it is larger than the sum of its proper divisors (22872521).
145556551 is an frugal number, since it uses more digits than its factorization.
145556551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030 (or 567 counting only the distinct ones).
The product of its digits is 75000, while the sum is 37.
The square root of 145556551 is about 12064.6819684565. The cubic root of 145556551 is about 526.0300876253.
The spelling of 145556551 in words is "one hundred forty-five million, five hundred fifty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •