Base | Representation |
---|---|
bin | 11000101111110101100101… |
… | …011110000111001011101001 |
3 | 112021101001021101201121112021 |
4 | 120233311211132013023221 |
5 | 103231220234432443424 |
6 | 1023252342050344441 |
7 | 31632315163551235 |
oct | 3057654536071351 |
9 | 467331241647467 |
10 | 108840468640489 |
11 | 31752a9009a733 |
12 | 1025a01888b121 |
13 | 48967c5b91391 |
14 | 1cc3c9a3355c5 |
15 | c8b2cc7304e4 |
hex | 62fd657872e9 |
108840468640489 has 8 divisors (see below), whose sum is σ = 110685395592000. Its totient is φ = 106995547463952.
The previous prime is 108840468640483. The next prime is 108840468640517. The reversal of 108840468640489 is 984046864048801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 108840468640489 - 25 = 108840468640457 is a prime.
It is a super-2 number, since 2×1088404686404892 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108840468640483) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55335292 + ... + 57268450.
It is an arithmetic number, because the mean of its divisors is an integer number (13835674449000).
Almost surely, 2108840468640489 is an apocalyptic number.
It is an amenable number.
108840468640489 is a deficient number, since it is larger than the sum of its proper divisors (1844926951511).
108840468640489 is an equidigital number, since it uses as much as digits as its factorization.
108840468640489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2887487.
The product of its (nonzero) digits is 339738624, while the sum is 70.
The spelling of 108840468640489 in words is "one hundred eight trillion, eight hundred forty billion, four hundred sixty-eight million, six hundred forty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •