Base | Representation |
---|---|
bin | 11010011011111001… |
… | …01111101111001001 |
3 | 1100122010000102110000 |
4 | 31031330233233021 |
5 | 213031310443224 |
6 | 10304154113213 |
7 | 1011464501400 |
oct | 151574575711 |
9 | 40563012400 |
10 | 14192671689 |
11 | 6023436339 |
12 | 290111b809 |
13 | 14524cb6b1 |
14 | 988d0c637 |
15 | 580ee10c9 |
hex | 34df2fbc9 |
14192671689 has 135 divisors (see below), whose sum is σ = 25908711543. Its totient is φ = 7719818400.
The previous prime is 14192671679. The next prime is 14192671721. The reversal of 14192671689 is 98617629141.
The square root of 14192671689 is 119133.
It is a perfect power (a square), and thus also a powerful number.
14192671689 is a `hidden beast` number, since 1 + 419 + 2 + 67 + 168 + 9 = 666.
It can be written as a sum of positive squares in only one way, i.e., 461519289 + 13731152400 = 21483^2 + 117180^2 .
It is not a de Polignac number, because 14192671689 - 213 = 14192663497 is a prime.
It is a super-2 number, since 2×141926716892 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14192671679) by changing a digit.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 232666719 + ... + 232666779.
Almost surely, 214192671689 is an apocalyptic number.
14192671689 is the 119133-rd square number.
14192671689 is the 59567-th centered octagonal number.
It is an amenable number.
14192671689 is a deficient number, since it is larger than the sum of its proper divisors (11716039854).
14192671689 is an frugal number, since it uses more digits than its factorization.
14192671689 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210 (or 102 counting only the distinct ones).
The product of its digits is 1306368, while the sum is 54.
The spelling of 14192671689 in words is "fourteen billion, one hundred ninety-two million, six hundred seventy-one thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •