Base | Representation |
---|---|
bin | 11010111010101000… |
… | …01001111000100101 |
3 | 1101022002002202020002 |
4 | 31131110021320211 |
5 | 214043304410331 |
6 | 10345523351045 |
7 | 1021044636323 |
oct | 153524117045 |
9 | 41262082202 |
10 | 14450466341 |
11 | 6145a03273 |
12 | 2973522485 |
13 | 1493a3cbcc |
14 | 9b1256d13 |
15 | 5989649cb |
hex | 35d509e25 |
14450466341 has 2 divisors, whose sum is σ = 14450466342. Its totient is φ = 14450466340.
The previous prime is 14450466319. The next prime is 14450466367. The reversal of 14450466341 is 14366405441.
14450466341 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., 9981009025 + 4469457316 = 99905^2 + 66854^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14450466341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14450466295 and 14450466304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14450456341) 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, 7225233170 + 7225233171.
It is an arithmetic number, because the mean of its divisors is an integer number (7225233171).
Almost surely, 214450466341 is an apocalyptic number.
It is an amenable number.
14450466341 is a deficient number, since it is larger than the sum of its proper divisors (1).
14450466341 is an equidigital number, since it uses as much as digits as its factorization.
14450466341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 14450466341 in words is "fourteen billion, four hundred fifty million, four hundred sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •