Base | Representation |
---|---|
bin | 110010100100111101… |
… | …1000101010101000001 |
3 | 101101100112011120202221 |
4 | 1211021323011111001 |
5 | 3234420242014424 |
6 | 121521411411041 |
7 | 10563365142100 |
oct | 1451173052501 |
9 | 341315146687 |
10 | 108614407489 |
11 | 42077001a35 |
12 | 190728b3a81 |
13 | a31c424193 |
14 | 5385182037 |
15 | 2c5a64b9e4 |
hex | 1949ec5541 |
108614407489 has 45 divisors (see below), whose sum is σ = 133591251747. Its totient is φ = 88049756256.
The previous prime is 108614407487. The next prime is 108614407507. The reversal of 108614407489 is 984704416801.
The square root of 108614407489 is 329567.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 20856269889 + 87758137600 = 144417^2 + 296240^2 .
It is not a de Polignac number, because 108614407489 - 21 = 108614407487 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108614407487) 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 in 44 ways as a sum of consecutive naturals, for example, 1220386557 + ... + 1220386645.
Almost surely, 2108614407489 is an apocalyptic number.
108614407489 is the 329567-th square number.
108614407489 is the 164784-th centered octagonal number.
It is an amenable number.
108614407489 is a deficient number, since it is larger than the sum of its proper divisors (24976844258).
108614407489 is an frugal number, since it uses more digits than its factorization.
108614407489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 52.
The spelling of 108614407489 in words is "one hundred eight billion, six hundred fourteen million, four hundred seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •