Base | Representation |
---|---|
bin | 11001000000010101110010… |
… | …000010010110010101000001 |
3 | 112102101110112112110010020221 |
4 | 121000111302002112111001 |
5 | 103403310340003114244 |
6 | 1025521340003503041 |
7 | 32110253614254022 |
oct | 3100256202262501 |
9 | 472343475403227 |
10 | 109974550832449 |
11 | 3204aa43a06a16 |
12 | 1040197a687a81 |
13 | 494972b9a0134 |
14 | 1d22b22074c49 |
15 | caaa553b8784 |
hex | 640572096541 |
109974550832449 has 8 divisors (see below), whose sum is σ = 110026348691360. Its totient is φ = 109922754195936.
The previous prime is 109974550832437. The next prime is 109974550832467. The reversal of 109974550832449 is 944238055479901.
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 109974550832449 - 215 = 109974550799681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109974550832149) 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 7 ways as a sum of consecutive naturals, for example, 215350477 + ... + 215860549.
It is an arithmetic number, because the mean of its divisors is an integer number (13753293586420).
Almost surely, 2109974550832449 is an apocalyptic number.
It is an amenable number.
109974550832449 is a deficient number, since it is larger than the sum of its proper divisors (51797858911).
109974550832449 is an equidigital number, since it uses as much as digits as its factorization.
109974550832449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611199.
The product of its (nonzero) digits is 391910400, while the sum is 70.
The spelling of 109974550832449 in words is "one hundred nine trillion, nine hundred seventy-four billion, five hundred fifty million, eight hundred thirty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •