Base | Representation |
---|---|
bin | 11010010010110111… |
… | …10000001111000001 |
3 | 1100102211110112120212 |
4 | 31021123300033001 |
5 | 212402412222423 |
6 | 10252450243505 |
7 | 1006554535001 |
oct | 151133601701 |
9 | 40384415525 |
10 | 14116914113 |
11 | 5a946a2575 |
12 | 289b886595 |
13 | 143c8c5323 |
14 | 97cc2c001 |
15 | 579529578 |
hex | 3496f03c1 |
14116914113 has 2 divisors, whose sum is σ = 14116914114. Its totient is φ = 14116914112.
The previous prime is 14116914083. The next prime is 14116914131. The reversal of 14116914113 is 31141961141.
Together with next prime (14116914131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13189833409 + 927080704 = 114847^2 + 30448^2 .
It is a cyclic number.
It is not a de Polignac number, because 14116914113 - 220 = 14115865537 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14116914113.
It is not a weakly prime, because it can be changed into another prime (14116914143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7058457056 + 7058457057.
It is an arithmetic number, because the mean of its divisors is an integer number (7058457057).
Almost surely, 214116914113 is an apocalyptic number.
It is an amenable number.
14116914113 is a deficient number, since it is larger than the sum of its proper divisors (1).
14116914113 is an equidigital number, since it uses as much as digits as its factorization.
14116914113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 32.
The spelling of 14116914113 in words is "fourteen billion, one hundred sixteen million, nine hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •