Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …110011001010101111001 |
3 | 10221012222012112102220211 |
4 | 100022303112121111321 |
5 | 121201023300230001 |
6 | 2210234231151121 |
7 | 143163232613116 |
oct | 20126326312571 |
9 | 3835865472824 |
10 | 1111110555001 |
11 | 399245a3a457 |
12 | 15b4108154a1 |
13 | 80a148a0785 |
14 | 3bac6d1590d |
15 | 1dd810cc351 |
hex | 102b3599579 |
1111110555001 has 16 divisors (see below), whose sum is σ = 1158499020240. Its totient is φ = 1064347764480.
The previous prime is 1111110554947. The next prime is 1111110555047. The reversal of 1111110555001 is 1005550111111.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 7663251600 + 1103447303401 = 87540^2 + 1050451^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111110555001 is a prime.
It is a super-2 number, since 2×11111105550012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111110556001) 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, 2824935 + ... + 3194131.
It is an arithmetic number, because the mean of its divisors is an integer number (72406188765).
Almost surely, 21111110555001 is an apocalyptic number.
It is an amenable number.
1111110555001 is a deficient number, since it is larger than the sum of its proper divisors (47388465239).
1111110555001 is a wasteful number, since it uses less digits than its factorization.
1111110555001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370044.
The product of its (nonzero) digits is 125, while the sum is 22.
Adding to 1111110555001 its reverse (1005550111111), we get a palindrome (2116660666112).
The spelling of 1111110555001 in words is "one trillion, one hundred eleven billion, one hundred ten million, five hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •