Base | Representation |
---|---|
bin | 10111111000000010000101… |
… | …011111001101101111110111 |
3 | 111202210102210210211101112121 |
4 | 113320002011133031233313 |
5 | 102230402432100130421 |
6 | 1011154523502500411 |
7 | 31055255441152051 |
oct | 2770020537155767 |
9 | 452712723741477 |
10 | 105005600005111 |
11 | 30504696792433 |
12 | b93a956b94707 |
13 | 4678ca7466ab0 |
14 | 1bd04262048d1 |
15 | c21683966d41 |
hex | 5f80857cdbf7 |
105005600005111 has 4 divisors (see below), whose sum is σ = 113082953851672. Its totient is φ = 96928246158552.
The previous prime is 105005600005109. The next prime is 105005600005123. The reversal of 105005600005111 is 111500006500501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105005600005111 - 21 = 105005600005109 is a prime.
It is a super-2 number, since 2×1050056000051112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105005600005181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4038676923261 + ... + 4038676923286.
It is an arithmetic number, because the mean of its divisors is an integer number (28270738462918).
Almost surely, 2105005600005111 is an apocalyptic number.
105005600005111 is a deficient number, since it is larger than the sum of its proper divisors (8077353846561).
105005600005111 is an equidigital number, since it uses as much as digits as its factorization.
105005600005111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8077353846560.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 105005600005111 its reverse (111500006500501), we get a palindrome (216505606505612).
The spelling of 105005600005111 in words is "one hundred five trillion, five billion, six hundred million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •