Base | Representation |
---|---|
bin | 11010001111000100… |
… | …11111101000000101 |
3 | 1100100121122120101211 |
4 | 31013202133220011 |
5 | 212321243023121 |
6 | 10245353051421 |
7 | 1006020413134 |
oct | 150742375005 |
9 | 40317576354 |
10 | 14085126661 |
11 | 5a78761151 |
12 | 28910b6b71 |
13 | 1436145898 |
14 | 97891591b |
15 | 57684ace1 |
hex | 34789fa05 |
14085126661 has 2 divisors, whose sum is σ = 14085126662. Its totient is φ = 14085126660.
The previous prime is 14085126631. The next prime is 14085126689. The reversal of 14085126661 is 16662158041.
14085126661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13601390625 + 483736036 = 116625^2 + 21994^2 .
It is an emirp because it is prime and its reverse (16662158041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14085126661 - 29 = 14085126149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14085126611) 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, 7042563330 + 7042563331.
It is an arithmetic number, because the mean of its divisors is an integer number (7042563331).
Almost surely, 214085126661 is an apocalyptic number.
It is an amenable number.
14085126661 is a deficient number, since it is larger than the sum of its proper divisors (1).
14085126661 is an equidigital number, since it uses as much as digits as its factorization.
14085126661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 40.
The spelling of 14085126661 in words is "fourteen billion, eighty-five million, one hundred twenty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •