Base | Representation |
---|---|
bin | 11010010100110001… |
… | …00000010100001000 |
3 | 1100110221102122100222 |
4 | 31022120200110020 |
5 | 212421001332223 |
6 | 10254215445212 |
7 | 1010140104152 |
oct | 151230402410 |
9 | 40427378328 |
10 | 14132839688 |
11 | 5aa268a700 |
12 | 28a5086808 |
13 | 1442cb0046 |
14 | 980db5ad2 |
15 | 57ab230c8 |
hex | 34a620508 |
14132839688 has 36 divisors (see below), whose sum is σ = 29134706685. Its totient is φ = 6422336800.
The previous prime is 14132839681. The next prime is 14132839697. The reversal of 14132839688 is 88693823141.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 11342676004 + 2790163684 = 106502^2 + 52822^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=84062.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14132839681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3696818 + ... + 3700638.
Almost surely, 214132839688 is an apocalyptic number.
It is an amenable number.
14132839688 is an abundant number, since it is smaller than the sum of its proper divisors (15001866997).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14132839688 is an frugal number, since it uses more digits than its factorization.
14132839688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7670 (or 3834 counting only the distinct ones).
The product of its digits is 1990656, while the sum is 53.
The spelling of 14132839688 in words is "fourteen billion, one hundred thirty-two million, eight hundred thirty-nine thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •