Base | Representation |
---|---|
bin | 10001100001100… |
… | …11111010001001 |
3 | 101020122001021110 |
4 | 20300303322021 |
5 | 300113411012 |
6 | 22331000533 |
7 | 3433410036 |
oct | 1060637211 |
9 | 336561243 |
10 | 147013257 |
11 | 75a92266 |
12 | 41299149 |
13 | 245c45c1 |
14 | 1574c38d |
15 | cd8e73c |
hex | 8c33e89 |
147013257 has 4 divisors (see below), whose sum is σ = 196017680. Its totient is φ = 98008836.
The previous prime is 147013231. The next prime is 147013271. The reversal of 147013257 is 752310741.
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 not a de Polignac number, because 147013257 - 210 = 147012233 is a prime.
It is a super-2 number, since 2×1470132572 = 43225795467496098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (147013057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24502207 + ... + 24502212.
It is an arithmetic number, because the mean of its divisors is an integer number (49004420).
Almost surely, 2147013257 is an apocalyptic number.
It is an amenable number.
147013257 is a deficient number, since it is larger than the sum of its proper divisors (49004423).
147013257 is an equidigital number, since it uses as much as digits as its factorization.
147013257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49004422.
The product of its (nonzero) digits is 5880, while the sum is 30.
The square root of 147013257 is about 12124.9023501222. The cubic root of 147013257 is about 527.7790735218.
Adding to 147013257 its reverse (752310741), we get a palindrome (899323998).
The spelling of 147013257 in words is "one hundred forty-seven million, thirteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •