Base | Representation |
---|---|
bin | 11001001000100110110001… |
… | …100011010110001010101111 |
3 | 112111101202122112002200100200 |
4 | 121020212301203112022233 |
5 | 103442112121321131343 |
6 | 1031034314122524543 |
7 | 32166302330525013 |
oct | 3110466143261257 |
9 | 474352575080320 |
10 | 110542552130223 |
11 | 32249918925964 |
12 | 10493a79066753 |
13 | 498b16c153ac5 |
14 | 1d42406672543 |
15 | cba6eae044d3 |
hex | 6489b18d62af |
110542552130223 has 12 divisors (see below), whose sum is σ = 159695520148320. Its totient is φ = 73684444823136.
The previous prime is 110542552130203. The next prime is 110542552130287. The reversal of 110542552130223 is 322031255245011.
110542552130223 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 425 + 5 + 2 + 1 + 3 + 0 + 223 = 666.
It is not a de Polignac number, because 110542552130223 - 218 = 110542551868079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110542552130203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 882428086 + ... + 882553347.
It is an arithmetic number, because the mean of its divisors is an integer number (13307960012360).
Almost surely, 2110542552130223 is an apocalyptic number.
110542552130223 is a deficient number, since it is larger than the sum of its proper divisors (49152968018097).
110542552130223 is a wasteful number, since it uses less digits than its factorization.
110542552130223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1764988398 (or 1764988395 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 110542552130223 in words is "one hundred ten trillion, five hundred forty-two billion, five hundred fifty-two million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •