Base | Representation |
---|---|
bin | 10001100001110… |
… | …11110100010101 |
3 | 101020200200201022 |
4 | 20300323310111 |
5 | 300120430103 |
6 | 22331410525 |
7 | 3433603346 |
oct | 1060736425 |
9 | 336620638 |
10 | 147045653 |
11 | 76004637 |
12 | 412b3a45 |
13 | 24606281 |
14 | 1575a0cd |
15 | cd99138 |
hex | 8c3bd15 |
147045653 has 4 divisors (see below), whose sum is σ = 147070560. Its totient is φ = 147020748.
The previous prime is 147045649. The next prime is 147045683. The reversal of 147045653 is 356540741.
147045653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, and also an emirpimes, since its reverse is a distinct semiprime: 356540741 = 811 ⋅439631.
It is a cyclic number.
It is not a de Polignac number, because 147045653 - 22 = 147045649 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (147045643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1976 + ... + 17262.
It is an arithmetic number, because the mean of its divisors is an integer number (36767640).
Almost surely, 2147045653 is an apocalyptic number.
It is an amenable number.
147045653 is a deficient number, since it is larger than the sum of its proper divisors (24907).
147045653 is an equidigital number, since it uses as much as digits as its factorization.
147045653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24906.
The product of its (nonzero) digits is 50400, while the sum is 35.
The square root of 147045653 is about 12126.2382048185. The cubic root of 147045653 is about 527.8178379967.
The spelling of 147045653 in words is "one hundred forty-seven million, forty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •