Base | Representation |
---|---|
bin | 10001100100101… |
… | …11100110110101 |
3 | 101021101210110001 |
4 | 20302113212311 |
5 | 300214442441 |
6 | 22343431301 |
7 | 3440030434 |
oct | 1062274665 |
9 | 337353401 |
10 | 147421621 |
11 | 76241056 |
12 | 41455531 |
13 | 24708439 |
14 | 1581711b |
15 | ce20731 |
hex | 8c979b5 |
147421621 has 2 divisors, whose sum is σ = 147421622. Its totient is φ = 147421620.
The previous prime is 147421619. The next prime is 147421649. The reversal of 147421621 is 126124741.
It is an a-pointer prime, because the next prime (147421649) can be obtained adding 147421621 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73719396 + 73702225 = 8586^2 + 8585^2 .
It is a cyclic number.
It is not a de Polignac number, because 147421621 - 21 = 147421619 is a prime.
Together with 147421619, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 147421621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (147421121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73710810 + 73710811.
It is an arithmetic number, because the mean of its divisors is an integer number (73710811).
Almost surely, 2147421621 is an apocalyptic number.
147421621 is the 8586-th centered square number.
It is an amenable number.
147421621 is a deficient number, since it is larger than the sum of its proper divisors (1).
147421621 is an equidigital number, since it uses as much as digits as its factorization.
147421621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2688, while the sum is 28.
The square root of 147421621 is about 12141.7305603444. The cubic root of 147421621 is about 528.2672987048.
The spelling of 147421621 in words is "one hundred forty-seven million, four hundred twenty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •