Base | Representation |
---|---|
bin | 10001100111010… |
… | …10100111101001 |
3 | 101022001001212101 |
4 | 20303222213221 |
5 | 300311333031 |
6 | 22355013401 |
7 | 3442644646 |
oct | 1063524751 |
9 | 338031771 |
10 | 147761641 |
11 | 76453565 |
12 | 4159a261 |
13 | 247c7131 |
14 | 158a4dcd |
15 | ce8b361 |
hex | 8cea9e9 |
147761641 has 4 divisors (see below), whose sum is σ = 152856900. Its totient is φ = 142666384.
The previous prime is 147761633. The next prime is 147761659. The reversal of 147761641 is 146167741.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 146167741 = 19 ⋅7693039.
It can be written as a sum of positive squares in 2 ways, for example, as 29387241 + 118374400 = 5421^2 + 10880^2 .
It is a cyclic number.
It is not a de Polignac number, because 147761641 - 23 = 147761633 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 147761641.
It is not an unprimeable number, because it can be changed into a prime (147761681) 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, 2547586 + ... + 2547643.
It is an arithmetic number, because the mean of its divisors is an integer number (38214225).
Almost surely, 2147761641 is an apocalyptic number.
It is an amenable number.
147761641 is a deficient number, since it is larger than the sum of its proper divisors (5095259).
147761641 is an equidigital number, since it uses as much as digits as its factorization.
147761641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5095258.
The product of its digits is 28224, while the sum is 37.
The square root of 147761641 is about 12155.7246184668. The cubic root of 147761641 is about 528.6731268473.
The spelling of 147761641 in words is "one hundred forty-seven million, seven hundred sixty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •