Base | Representation |
---|---|
bin | 10001100111010… |
… | …01010000010001 |
3 | 101022000210012021 |
4 | 20303221100101 |
5 | 300311143144 |
6 | 22354531441 |
7 | 3442622440 |
oct | 1063512021 |
9 | 338023167 |
10 | 147756049 |
11 | 7644a341 |
12 | 41596b81 |
13 | 247c471c |
14 | 158a2d57 |
15 | ce89884 |
hex | 8ce9411 |
147756049 has 4 divisors (see below), whose sum is σ = 168864064. Its totient is φ = 126648036.
The previous prime is 147756029. The next prime is 147756053. The reversal of 147756049 is 940657741.
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 147756049 - 215 = 147723281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 147755996 and 147756014.
It is not an unprimeable number, because it can be changed into a prime (147756029) 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 3 ways as a sum of consecutive naturals, for example, 10553997 + ... + 10554010.
It is an arithmetic number, because the mean of its divisors is an integer number (42216016).
Almost surely, 2147756049 is an apocalyptic number.
It is an amenable number.
147756049 is a deficient number, since it is larger than the sum of its proper divisors (21108015).
147756049 is an equidigital number, since it uses as much as digits as its factorization.
147756049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21108014.
The product of its (nonzero) digits is 211680, while the sum is 43.
The square root of 147756049 is about 12155.4946012081. The cubic root of 147756049 is about 528.6664575986. Note that the first 3 decimals are identical.
The spelling of 147756049 in words is "one hundred forty-seven million, seven hundred fifty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •