Base | Representation |
---|---|
bin | 10111111000000111101000… |
… | …110000101101111011011011 |
3 | 111202211000012012120011022122 |
4 | 113320013220300231323123 |
5 | 102231002133442130201 |
6 | 1011201351145011455 |
7 | 31055556235443644 |
oct | 2770075060557333 |
9 | 452730165504278 |
10 | 105011560505051 |
11 | 30507175294242 |
12 | b93bb3b183b8b |
13 | 46797172b2735 |
14 | 1bd082da906cb |
15 | c218d1d9ae1b |
hex | 5f81e8c2dedb |
105011560505051 has 2 divisors, whose sum is σ = 105011560505052. Its totient is φ = 105011560505050.
The previous prime is 105011560504973. The next prime is 105011560505231. The reversal of 105011560505051 is 150505065110501.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105011560505051 is a prime.
It is a super-2 number, since 2×1050115605050512 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (105011560505251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52505780252525 + 52505780252526.
It is an arithmetic number, because the mean of its divisors is an integer number (52505780252526).
Almost surely, 2105011560505051 is an apocalyptic number.
105011560505051 is a deficient number, since it is larger than the sum of its proper divisors (1).
105011560505051 is an equidigital number, since it uses as much as digits as its factorization.
105011560505051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18750, while the sum is 35.
The spelling of 105011560505051 in words is "one hundred five trillion, eleven billion, five hundred sixty million, five hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •