Base | Representation |
---|---|
bin | 11010001000110011… |
… | …00001111101001101 |
3 | 1100012221112002002212 |
4 | 31010121201331031 |
5 | 212214301222021 |
6 | 10240232000205 |
7 | 1004510550062 |
oct | 150431417515 |
9 | 40187462085 |
10 | 14032445261 |
11 | 5a50a498aa |
12 | 2877530065 |
13 | 142825bb63 |
14 | 971920c69 |
15 | 571de185b |
hex | 344661f4d |
14032445261 has 2 divisors, whose sum is σ = 14032445262. Its totient is φ = 14032445260.
The previous prime is 14032445257. The next prime is 14032445327. The reversal of 14032445261 is 16254423041.
14032445261 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., 11916997225 + 2115448036 = 109165^2 + 45994^2 .
It is a cyclic number.
It is not a de Polignac number, because 14032445261 - 22 = 14032445257 is a prime.
It is a super-2 number, since 2×140324452612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14032445561) 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, 7016222630 + 7016222631.
It is an arithmetic number, because the mean of its divisors is an integer number (7016222631).
Almost surely, 214032445261 is an apocalyptic number.
It is an amenable number.
14032445261 is a deficient number, since it is larger than the sum of its proper divisors (1).
14032445261 is an equidigital number, since it uses as much as digits as its factorization.
14032445261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 32.
The spelling of 14032445261 in words is "fourteen billion, thirty-two million, four hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •