Base | Representation |
---|---|
bin | 110001001011011101… |
… | …0011000001101111011 |
3 | 101002121012220210212011 |
4 | 1202112322120031323 |
5 | 3212242420213201 |
6 | 120303404230351 |
7 | 10426066355461 |
oct | 1422672301573 |
9 | 332535823764 |
10 | 105611101051 |
11 | 408757933a5 |
12 | 18574b3b3b7 |
13 | 9c61152991 |
14 | 517c358831 |
15 | 2b31b53151 |
hex | 1896e9837b |
105611101051 has 2 divisors, whose sum is σ = 105611101052. Its totient is φ = 105611101050.
The previous prime is 105611101049. The next prime is 105611101061. The reversal of 105611101051 is 150101116501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105611101051 - 21 = 105611101049 is a prime.
It is a super-2 number, since 2×1056111010512 (a number of 23 digits) contains 22 as substring.
Together with 105611101049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (105611101021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52805550525 + 52805550526.
It is an arithmetic number, because the mean of its divisors is an integer number (52805550526).
Almost surely, 2105611101051 is an apocalyptic number.
105611101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
105611101051 is an equidigital number, since it uses as much as digits as its factorization.
105611101051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 105611101051 its reverse (150101116501), we get a palindrome (255712217552).
The spelling of 105611101051 in words is "one hundred five billion, six hundred eleven million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •