Base | Representation |
---|---|
bin | 110001001100110001… |
… | …1110001010001101111 |
3 | 101002201022110211001001 |
4 | 1202121203301101233 |
5 | 3212340302143111 |
6 | 120312032101131 |
7 | 10430145661165 |
oct | 1423143612157 |
9 | 332638424031 |
10 | 105655506031 |
11 | 40898862529 |
12 | 185879947a7 |
13 | 9c6a3cc50a |
14 | 51841d7235 |
15 | 2b359c51c1 |
hex | 18998f146f |
105655506031 has 2 divisors, whose sum is σ = 105655506032. Its totient is φ = 105655506030.
The previous prime is 105655505987. The next prime is 105655506043. The reversal of 105655506031 is 130605556501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105655506031 - 227 = 105521288303 is a prime.
It is a super-2 number, since 2×1056555060312 (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 (105655536031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52827753015 + 52827753016.
It is an arithmetic number, because the mean of its divisors is an integer number (52827753016).
Almost surely, 2105655506031 is an apocalyptic number.
105655506031 is a deficient number, since it is larger than the sum of its proper divisors (1).
105655506031 is an equidigital number, since it uses as much as digits as its factorization.
105655506031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 105655506031 in words is "one hundred five billion, six hundred fifty-five million, five hundred six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •