Base | Representation |
---|---|
bin | 11010001010111101… |
… | …00001110010101111 |
3 | 1100021012120000011121 |
4 | 31011132201302233 |
5 | 212233414020102 |
6 | 10242115401411 |
7 | 1005120361453 |
oct | 150536416257 |
9 | 40235500147 |
10 | 14050532527 |
11 | 5a60183059 |
12 | 28815b3267 |
13 | 142bc22795 |
14 | 9740ac663 |
15 | 5737b5b37 |
hex | 3457a1caf |
14050532527 has 2 divisors, whose sum is σ = 14050532528. Its totient is φ = 14050532526.
The previous prime is 14050532497. The next prime is 14050532533. The reversal of 14050532527 is 72523505041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14050532527 - 223 = 14042143919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14050532492 and 14050532501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14050532557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7025266263 + 7025266264.
It is an arithmetic number, because the mean of its divisors is an integer number (7025266264).
Almost surely, 214050532527 is an apocalyptic number.
14050532527 is a deficient number, since it is larger than the sum of its proper divisors (1).
14050532527 is an equidigital number, since it uses as much as digits as its factorization.
14050532527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 34.
The spelling of 14050532527 in words is "fourteen billion, fifty million, five hundred thirty-two thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •