Base | Representation |
---|---|
bin | 11001000100001111010111… |
… | …011101011100000111111101 |
3 | 112110100002021012002221222010 |
4 | 121010033113131130013331 |
5 | 103422203210320431440 |
6 | 1030244420210241433 |
7 | 32135521631116623 |
oct | 3104172735340775 |
9 | 473302235087863 |
10 | 110242540405245 |
11 | 321436650504a6 |
12 | 104458ab886279 |
13 | 4968a99a7b451 |
14 | 1d31aa5b5b513 |
15 | cb29dc6cb580 |
hex | 6443d775c1fd |
110242540405245 has 8 divisors (see below), whose sum is σ = 176388064648416. Its totient is φ = 58796021549456.
The previous prime is 110242540405223. The next prime is 110242540405253. The reversal of 110242540405245 is 542504045242011.
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 110242540405245 - 28 = 110242540404989 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3674751346827 + ... + 3674751346856.
It is an arithmetic number, because the mean of its divisors is an integer number (22048508081052).
Almost surely, 2110242540405245 is an apocalyptic number.
110242540405245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
110242540405245 is a deficient number, since it is larger than the sum of its proper divisors (66145524243171).
110242540405245 is an equidigital number, since it uses as much as digits as its factorization.
110242540405245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7349502693691.
The product of its (nonzero) digits is 256000, while the sum is 39.
Adding to 110242540405245 its reverse (542504045242011), we get a palindrome (652746585647256).
The spelling of 110242540405245 in words is "one hundred ten trillion, two hundred forty-two billion, five hundred forty million, four hundred five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •