Base | Representation |
---|---|
bin | 110001001000110011… |
… | …1101000110010011111 |
3 | 101002101000211100121112 |
4 | 1202101213220302133 |
5 | 3212102202131421 |
6 | 120250513052235 |
7 | 10423640524442 |
oct | 1422147506237 |
9 | 332330740545 |
10 | 105522302111 |
11 | 4082a652446 |
12 | 1854b25707b |
13 | 9c48931625 |
14 | 5170641659 |
15 | 2b28e6245b |
hex | 18919e8c9f |
105522302111 has 8 divisors (see below), whose sum is σ = 107104262784. Its totient is φ = 103940547480.
The previous prime is 105522302089. The next prime is 105522302113. The reversal of 105522302111 is 111203225501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105522302111 - 214 = 105522285727 is a prime.
It is a super-2 number, since 2×1055223021112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105522302113) 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 in 7 ways as a sum of consecutive naturals, for example, 1210166 + ... + 1294428.
It is an arithmetic number, because the mean of its divisors is an integer number (13388032848).
Almost surely, 2105522302111 is an apocalyptic number.
105522302111 is a deficient number, since it is larger than the sum of its proper divisors (1581960673).
105522302111 is an equidigital number, since it uses as much as digits as its factorization.
105522302111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103021.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 105522302111 its reverse (111203225501), we get a palindrome (216725527612).
The spelling of 105522302111 in words is "one hundred five billion, five hundred twenty-two million, three hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •