Base | Representation |
---|---|
bin | 110001001000010100… |
… | …1110111110010001001 |
3 | 101002022220100202000222 |
4 | 1202100221313302021 |
5 | 3212034031014401 |
6 | 120245134035425 |
7 | 10423353100043 |
oct | 1422051676211 |
9 | 332286322028 |
10 | 105506110601 |
11 | 408214a3531 |
12 | 18545948b75 |
13 | 9c45482858 |
14 | 516c428a93 |
15 | 2b27814c1b |
hex | 1890a77c89 |
105506110601 has 2 divisors, whose sum is σ = 105506110602. Its totient is φ = 105506110600.
The previous prime is 105506110579. The next prime is 105506110607. The reversal of 105506110601 is 106011605501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76258270201 + 29247840400 = 276149^2 + 171020^2 .
It is an emirp because it is prime and its reverse (106011605501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105506110601 - 234 = 88326241417 is a prime.
It is a super-3 number, since 3×1055061106013 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (105506110607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52753055300 + 52753055301.
It is an arithmetic number, because the mean of its divisors is an integer number (52753055301).
Almost surely, 2105506110601 is an apocalyptic number.
It is an amenable number.
105506110601 is a deficient number, since it is larger than the sum of its proper divisors (1).
105506110601 is an equidigital number, since it uses as much as digits as its factorization.
105506110601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 105506110601 in words is "one hundred five billion, five hundred six million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •