Base | Representation |
---|---|
bin | 10111111000000111000111… |
… | …101001110110000001001011 |
3 | 111202210221202111101101011102 |
4 | 113320013013221312001023 |
5 | 102231000014243230201 |
6 | 1011201220103452015 |
7 | 31055536412263124 |
oct | 2770070751660113 |
9 | 452727674341142 |
10 | 105011005055051 |
11 | 30506a0a7a4457 |
12 | b93ba0515700b |
13 | 46796591b46b4 |
14 | 1bd07b9dc304b |
15 | c2189d22d26b |
hex | 5f81c7a7604b |
105011005055051 has 4 divisors (see below), whose sum is σ = 105011763675000. Its totient is φ = 105010246435104.
The previous prime is 105011005054999. The next prime is 105011005055071. The reversal of 105011005055051 is 150550500110501.
It is a happy number.
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 105011005055051 - 242 = 100612958543947 is a prime.
It is a super-2 number, since 2×1050110050550512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105011005055071) 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, 379102301 + ... + 379379198.
It is an arithmetic number, because the mean of its divisors is an integer number (26252940918750).
Almost surely, 2105011005055051 is an apocalyptic number.
105011005055051 is a deficient number, since it is larger than the sum of its proper divisors (758619949).
105011005055051 is an equidigital number, since it uses as much as digits as its factorization.
105011005055051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758619948.
The product of its (nonzero) digits is 3125, while the sum is 29.
Adding to 105011005055051 its reverse (150550500110501), we get a palindrome (255561505165552).
The spelling of 105011005055051 in words is "one hundred five trillion, eleven billion, five million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •