Base | Representation |
---|---|
bin | 11001001101001111100110… |
… | …001011110000110000010101 |
3 | 112112112020022000022011002010 |
4 | 121031033212023300300111 |
5 | 104012322331224020041 |
6 | 1031440543324534433 |
7 | 32231314303041012 |
oct | 3115174613606025 |
9 | 475466260264063 |
10 | 110861262720021 |
11 | 32361aa7727210 |
12 | 105257a46b1419 |
13 | 49b223148c508 |
14 | 1d539dc734709 |
15 | cc3b51031a16 |
hex | 64d3e62f0c15 |
110861262720021 has 16 divisors (see below), whose sum is σ = 161258735582208. Its totient is φ = 67186148319600.
The previous prime is 110861262719951. The next prime is 110861262720059. The reversal of 110861262720021 is 120027262168011.
It is not a de Polignac number, because 110861262720021 - 230 = 110860188978197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110861262720071) 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 15 ways as a sum of consecutive naturals, for example, 61491775 + ... + 63268956.
It is an arithmetic number, because the mean of its divisors is an integer number (10078670973888).
Almost surely, 2110861262720021 is an apocalyptic number.
110861262720021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110861262720021 is a deficient number, since it is larger than the sum of its proper divisors (50397472862187).
110861262720021 is a wasteful number, since it uses less digits than its factorization.
110861262720021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124787672.
The product of its (nonzero) digits is 32256, while the sum is 39.
The spelling of 110861262720021 in words is "one hundred ten trillion, eight hundred sixty-one billion, two hundred sixty-two million, seven hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •