Base | Representation |
---|---|
bin | 11010010001101110… |
… | …01011100110100001 |
3 | 1100102011102110101012 |
4 | 31020313023212201 |
5 | 212342433430011 |
6 | 10251504550305 |
7 | 1006410204614 |
oct | 151067134641 |
9 | 40364373335 |
10 | 14107326881 |
11 | 5a8a24453a |
12 | 2898622395 |
13 | 143a9195cb |
14 | 97b85417b |
15 | 578783a8b |
hex | 348dcb9a1 |
14107326881 has 2 divisors, whose sum is σ = 14107326882. Its totient is φ = 14107326880.
The previous prime is 14107326847. The next prime is 14107326889. The reversal of 14107326881 is 18862370141.
14107326881 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., 14103937600 + 3389281 = 118760^2 + 1841^2 .
It is a cyclic number.
It is not a de Polignac number, because 14107326881 - 218 = 14107064737 is a prime.
It is a super-2 number, since 2×141073268812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14107326889) 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, 7053663440 + 7053663441.
It is an arithmetic number, because the mean of its divisors is an integer number (7053663441).
Almost surely, 214107326881 is an apocalyptic number.
It is an amenable number.
14107326881 is a deficient number, since it is larger than the sum of its proper divisors (1).
14107326881 is an equidigital number, since it uses as much as digits as its factorization.
14107326881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 41.
The spelling of 14107326881 in words is "fourteen billion, one hundred seven million, three hundred twenty-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •