Base | Representation |
---|---|
bin | 110000111100100001… |
… | …1000010101011000111 |
3 | 101001022022010001202002 |
4 | 1201321003002223013 |
5 | 3210231133234443 |
6 | 120141545135515 |
7 | 10410503505566 |
oct | 1417103025307 |
9 | 331268101662 |
10 | 105110055623 |
11 | 40638982571 |
12 | 1845518a59b |
13 | 9bb13c2ab1 |
14 | 51319adbdd |
15 | 2b02b802b8 |
hex | 18790c2ac7 |
105110055623 has 2 divisors, whose sum is σ = 105110055624. Its totient is φ = 105110055622.
The previous prime is 105110055601. The next prime is 105110055719. The reversal of 105110055623 is 326550011501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105110055623 - 214 = 105110039239 is a prime.
It is a super-2 number, since 2×1051100556232 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105110055823) 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, 52555027811 + 52555027812.
It is an arithmetic number, because the mean of its divisors is an integer number (52555027812).
Almost surely, 2105110055623 is an apocalyptic number.
105110055623 is a deficient number, since it is larger than the sum of its proper divisors (1).
105110055623 is an equidigital number, since it uses as much as digits as its factorization.
105110055623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 105110055623 in words is "one hundred five billion, one hundred ten million, fifty-five thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •