Base | Representation |
---|---|
bin | 11001000001100001101100… |
… | …010111010101111010100111 |
3 | 112102200020221001102110001101 |
4 | 121001201230113111322213 |
5 | 103411124302333113421 |
6 | 1030023020033140531 |
7 | 32116200523220026 |
oct | 3101415427257247 |
9 | 472606831373041 |
10 | 110056060051111 |
11 | 3208157081a349 |
12 | 104157279ba747 |
13 | 495431b6a4235 |
14 | 1d26a554328bd |
15 | cacc26103191 |
hex | 64186c5d5ea7 |
110056060051111 has 2 divisors, whose sum is σ = 110056060051112. Its totient is φ = 110056060051110.
The previous prime is 110056060051087. The next prime is 110056060051127. The reversal of 110056060051111 is 111150060650011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110056060051111 - 25 = 110056060051079 is a prime.
It is a super-2 number, since 2×1100560600511112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110056060051111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110056064051111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55028030025555 + 55028030025556.
It is an arithmetic number, because the mean of its divisors is an integer number (55028030025556).
Almost surely, 2110056060051111 is an apocalyptic number.
110056060051111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110056060051111 is an equidigital number, since it uses as much as digits as its factorization.
110056060051111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 28.
The spelling of 110056060051111 in words is "one hundred ten trillion, fifty-six billion, sixty million, fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •