Base | Representation |
---|---|
bin | 11001001000101000100001… |
… | …011111101111000111110101 |
3 | 112111101221111102002010201201 |
4 | 121020220201133233013311 |
5 | 103442124443114411203 |
6 | 1031035224333052501 |
7 | 32166400014241366 |
oct | 3110504137570765 |
9 | 474357442063651 |
10 | 110544430232053 |
11 | 3224a6a1a84634 |
12 | 10494302027131 |
13 | 498b3ab28b26c |
14 | 1d42543c79b6d |
15 | cba7aac38e1d |
hex | 648a217ef1f5 |
110544430232053 has 16 divisors (see below), whose sum is σ = 116173705981696. Its totient is φ = 105054241723200.
The previous prime is 110544430232029. The next prime is 110544430232081. The reversal of 110544430232053 is 350232034445011.
It is a cyclic number.
It is not a de Polignac number, because 110544430232053 - 29 = 110544430231541 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110544430233053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162421300 + ... + 163100482.
It is an arithmetic number, because the mean of its divisors is an integer number (7260856623856).
Almost surely, 2110544430232053 is an apocalyptic number.
It is an amenable number.
110544430232053 is a deficient number, since it is larger than the sum of its proper divisors (5629275749643).
110544430232053 is a wasteful number, since it uses less digits than its factorization.
110544430232053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 781564.
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 110544430232053 its reverse (350232034445011), we get a palindrome (460776464677064).
The spelling of 110544430232053 in words is "one hundred ten trillion, five hundred forty-four billion, four hundred thirty million, two hundred thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •