Base | Representation |
---|---|
bin | 11011110001100011… |
… | …00000101110001101 |
3 | 1102111011221202010202 |
4 | 31320301200232031 |
5 | 221014223200033 |
6 | 10503341343245 |
7 | 1035340441316 |
oct | 157061405615 |
9 | 42434852122 |
10 | 14911146893 |
11 | 6361a543a5 |
12 | 2a81867b25 |
13 | 1538309156 |
14 | a164d560d |
15 | 5c41128e8 |
hex | 378c60b8d |
14911146893 has 2 divisors, whose sum is σ = 14911146894. Its totient is φ = 14911146892.
The previous prime is 14911146823. The next prime is 14911146931. The reversal of 14911146893 is 39864111941.
14911146893 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., 13511040169 + 1400106724 = 116237^2 + 37418^2 .
It is an emirp because it is prime and its reverse (39864111941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14911146893 - 220 = 14910098317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14911146823) 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, 7455573446 + 7455573447.
It is an arithmetic number, because the mean of its divisors is an integer number (7455573447).
Almost surely, 214911146893 is an apocalyptic number.
It is an amenable number.
14911146893 is a deficient number, since it is larger than the sum of its proper divisors (1).
14911146893 is an equidigital number, since it uses as much as digits as its factorization.
14911146893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 186624, while the sum is 47.
The spelling of 14911146893 in words is "fourteen billion, nine hundred eleven million, one hundred forty-six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •