Base | Representation |
---|---|
bin | 11010001100010011… |
… | …11111110111010001 |
3 | 1100021222222221200001 |
4 | 31012021333313101 |
5 | 212244323143024 |
6 | 10243203530001 |
7 | 1005316262212 |
oct | 150611776721 |
9 | 40258887601 |
10 | 14061927889 |
11 | 5a66656609 |
12 | 2885389901 |
13 | 14313b24b9 |
14 | 9757d7409 |
15 | 5747b7244 |
hex | 34627fdd1 |
14061927889 has 3 divisors (see below), whose sum is σ = 14062046473. Its totient is φ = 14061809306.
The previous prime is 14061927881. The next prime is 14061927941. The reversal of 14061927889 is 98872916041.
It is a happy number.
The square root of 14061927889 is 118583.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 98872916041 = 163 ⋅606582307.
It is not a de Polignac number, because 14061927889 - 23 = 14061927881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14061927881) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 59292 + ... + 177874.
Almost surely, 214061927889 is an apocalyptic number.
14061927889 is the 118583-rd square number.
14061927889 is the 59292-nd centered octagonal number.
It is an amenable number.
14061927889 is a deficient number, since it is larger than the sum of its proper divisors (118584).
14061927889 is an frugal number, since it uses more digits than its factorization.
14061927889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237166 (or 118583 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 55.
The spelling of 14061927889 in words is "fourteen billion, sixty-one million, nine hundred twenty-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •