Base | Representation |
---|---|
bin | 11010001000001100… |
… | …10110011101110101 |
3 | 1100012121001122021001 |
4 | 31010012112131311 |
5 | 212212004324321 |
6 | 10235532123301 |
7 | 1004420036551 |
oct | 150406263565 |
9 | 40177048231 |
10 | 14027417461 |
11 | 5a491253a2 |
12 | 2875906531 |
13 | 14271bb525 |
14 | 970db2861 |
15 | 57174bc91 |
hex | 344196775 |
14027417461 has 2 divisors, whose sum is σ = 14027417462. Its totient is φ = 14027417460.
The previous prime is 14027417441. The next prime is 14027417483. The reversal of 14027417461 is 16471472041.
14027417461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9720776836 + 4306640625 = 98594^2 + 65625^2 .
It is a cyclic number.
It is not a de Polignac number, because 14027417461 - 219 = 14026893173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14027417461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14027417441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7013708730 + 7013708731.
It is an arithmetic number, because the mean of its divisors is an integer number (7013708731).
Almost surely, 214027417461 is an apocalyptic number.
It is an amenable number.
14027417461 is a deficient number, since it is larger than the sum of its proper divisors (1).
14027417461 is an equidigital number, since it uses as much as digits as its factorization.
14027417461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37632, while the sum is 37.
The spelling of 14027417461 in words is "fourteen billion, twenty-seven million, four hundred seventeen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •