Base | Representation |
---|---|
bin | 10010001111101… |
… | …01010111100111 |
3 | 101122222200010212 |
4 | 21013311113213 |
5 | 303140023201 |
6 | 23104210035 |
7 | 3535614455 |
oct | 1107652747 |
9 | 348880125 |
10 | 153048551 |
11 | 79434707 |
12 | 4330991b |
13 | 25928696 |
14 | 1647d9d5 |
15 | d682abb |
hex | 91f55e7 |
153048551 has 4 divisors (see below), whose sum is σ = 153531672. Its totient is φ = 152565432.
The previous prime is 153048547. The next prime is 153048559. The reversal of 153048551 is 155840351.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155840351 = 131 ⋅1189621.
It is a cyclic number.
It is not a de Polignac number, because 153048551 - 22 = 153048547 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153048559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 241085 + ... + 241718.
It is an arithmetic number, because the mean of its divisors is an integer number (38382918).
Almost surely, 2153048551 is an apocalyptic number.
153048551 is a deficient number, since it is larger than the sum of its proper divisors (483121).
153048551 is an equidigital number, since it uses as much as digits as its factorization.
153048551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483120.
The product of its (nonzero) digits is 12000, while the sum is 32.
The square root of 153048551 is about 12371.2792790398. The cubic root of 153048551 is about 534.9046920216.
The spelling of 153048551 in words is "one hundred fifty-three million, forty-eight thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •