Base | Representation |
---|---|
bin | 10001100011111… |
… | …01010110000101 |
3 | 101021012022220001 |
4 | 20301331112011 |
5 | 300203022203 |
6 | 22341241301 |
7 | 3436102015 |
oct | 1061752605 |
9 | 337168801 |
10 | 147314053 |
11 | 76178257 |
12 | 41403231 |
13 | 2469b4a3 |
14 | 157c9c45 |
15 | cded91d |
hex | 8c7d585 |
147314053 has 2 divisors, whose sum is σ = 147314054. Its totient is φ = 147314052.
The previous prime is 147314009. The next prime is 147314093. The reversal of 147314053 is 350413741.
147314053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118766404 + 28547649 = 10898^2 + 5343^2 .
It is a cyclic number.
It is not a de Polignac number, because 147314053 - 29 = 147313541 is a prime.
It is a super-2 number, since 2×1473140532 = 43402860422573618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (147314093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73657026 + 73657027.
It is an arithmetic number, because the mean of its divisors is an integer number (73657027).
Almost surely, 2147314053 is an apocalyptic number.
It is an amenable number.
147314053 is a deficient number, since it is larger than the sum of its proper divisors (1).
147314053 is an equidigital number, since it uses as much as digits as its factorization.
147314053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 147314053 is about 12137.3000704440. The cubic root of 147314053 is about 528.1387818632.
Adding to 147314053 its reverse (350413741), we get a palindrome (497727794).
The spelling of 147314053 in words is "one hundred forty-seven million, three hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •