Base | Representation |
---|---|
bin | 11001000010111100011001… |
… | …011001011010010000010011 |
3 | 112110000120022111011221020200 |
4 | 121002330121121122100103 |
5 | 103414223232244111201 |
6 | 1030135444123510243 |
7 | 32126216144025042 |
oct | 3102743131322023 |
9 | 473016274157220 |
10 | 110153452332051 |
11 | 321098a9168527 |
12 | 10430588388383 |
13 | 496056cb6a43b |
14 | 1d2b654002559 |
15 | cb0526435386 |
hex | 642f1965a413 |
110153452332051 has 12 divisors (see below), whose sum is σ = 161027536743528. Its totient is φ = 72550868202144.
The previous prime is 110153452332047. The next prime is 110153452332059. The reversal of 110153452332051 is 150233254351011.
It is a happy number.
110153452332051 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 53 + 4 + 523 + 32 + 0 + 51 = 666.
It is not a de Polignac number, because 110153452332051 - 22 = 110153452332047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110153452331997 and 110153452332015.
It is not an unprimeable number, because it can be changed into a prime (110153452332059) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 73730556370 + ... + 73730557863.
It is an arithmetic number, because the mean of its divisors is an integer number (13418961395294).
Almost surely, 2110153452332051 is an apocalyptic number.
110153452332051 is a deficient number, since it is larger than the sum of its proper divisors (50874084411477).
110153452332051 is a wasteful number, since it uses less digits than its factorization.
110153452332051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147461114322 (or 147461114319 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The spelling of 110153452332051 in words is "one hundred ten trillion, one hundred fifty-three billion, four hundred fifty-two million, three hundred thirty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •