Base | Representation |
---|---|
bin | 11001000001100001101100… |
… | …010111010101111010101001 |
3 | 112102200020221001102110001110 |
4 | 121001201230113111322221 |
5 | 103411124302333113423 |
6 | 1030023020033140533 |
7 | 32116200523220031 |
oct | 3101415427257251 |
9 | 472606831373043 |
10 | 110056060051113 |
11 | 3208157081a350 |
12 | 104157279ba749 |
13 | 495431b6a4237 |
14 | 1d26a554328c1 |
15 | cacc26103193 |
hex | 64186c5d5ea9 |
110056060051113 has 16 divisors (see below), whose sum is σ = 160556561320896. Its totient is φ = 66502717693440.
The previous prime is 110056060051111. The next prime is 110056060051127. The reversal of 110056060051113 is 311150060650011.
It is not a de Polignac number, because 110056060051113 - 21 = 110056060051111 is a prime.
It is a super-2 number, since 2×1100560600511132 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110056060051111) 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, 4948107756 + ... + 4948129997.
It is an arithmetic number, because the mean of its divisors is an integer number (10034785082556).
Almost surely, 2110056060051113 is an apocalyptic number.
It is an amenable number.
110056060051113 is a deficient number, since it is larger than the sum of its proper divisors (50500501269783).
110056060051113 is a wasteful number, since it uses less digits than its factorization.
110056060051113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9896238104.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 110056060051113 in words is "one hundred ten trillion, fifty-six billion, sixty million, fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •