Base | Representation |
---|---|
bin | 11010100010110000… |
… | …01111100010111001 |
3 | 1100210010021202020121 |
4 | 31101120033202321 |
5 | 213141023232023 |
6 | 10314011253241 |
7 | 1013063541106 |
oct | 152130174271 |
9 | 40703252217 |
10 | 14250211513 |
11 | 605296690a |
12 | 291844a221 |
13 | 14613c6925 |
14 | 992809aad |
15 | 5860a9d5d |
hex | 35160f8b9 |
14250211513 has 2 divisors, whose sum is σ = 14250211514. Its totient is φ = 14250211512.
The previous prime is 14250211511. The next prime is 14250211541. The reversal of 14250211513 is 31511205241.
14250211513 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., 14010983424 + 239228089 = 118368^2 + 15467^2 .
It is a cyclic number.
It is not a de Polignac number, because 14250211513 - 21 = 14250211511 is a prime.
Together with 14250211511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (14250211511) 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, 7125105756 + 7125105757.
It is an arithmetic number, because the mean of its divisors is an integer number (7125105757).
Almost surely, 214250211513 is an apocalyptic number.
It is an amenable number.
14250211513 is a deficient number, since it is larger than the sum of its proper divisors (1).
14250211513 is an equidigital number, since it uses as much as digits as its factorization.
14250211513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 14250211513 its reverse (31511205241), we get a palindrome (45761416754).
The spelling of 14250211513 in words is "fourteen billion, two hundred fifty million, two hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •