Base | Representation |
---|---|
bin | 10111111000000001100101… |
… | …000100011000011011010011 |
3 | 111202210101101220101011001202 |
4 | 113320001211010120123103 |
5 | 102230400323330200201 |
6 | 1011154353513021415 |
7 | 31055236115064032 |
oct | 2770014504303323 |
9 | 452711356334052 |
10 | 105005056100051 |
11 | 30504437768518 |
12 | b93a8249b486b |
13 | 4678c1b87b893 |
14 | 1bd03b3ca0719 |
15 | c21650d29c6b |
hex | 5f80651186d3 |
105005056100051 has 4 divisors (see below), whose sum is σ = 105005638861704. Its totient is φ = 105004473338400.
The previous prime is 105005056100047. The next prime is 105005056100143. The reversal of 105005056100051 is 150001650500501.
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 105005056100051 - 22 = 105005056100047 is a prime.
It is a super-2 number, since 2×1050050561000512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105005056099987 and 105005056100023.
It is not an unprimeable number, because it can be changed into a prime (105005056100041) 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, 291110465 + ... + 291470946.
It is an arithmetic number, because the mean of its divisors is an integer number (26251409715426).
Almost surely, 2105005056100051 is an apocalyptic number.
105005056100051 is a deficient number, since it is larger than the sum of its proper divisors (582761653).
105005056100051 is an equidigital number, since it uses as much as digits as its factorization.
105005056100051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582761652.
The product of its (nonzero) digits is 3750, while the sum is 29.
The spelling of 105005056100051 in words is "one hundred five trillion, five billion, fifty-six million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •