Base | Representation |
---|---|
bin | 110001001000110001… |
… | …1000100111100000011 |
3 | 101002100221120121210201 |
4 | 1202101203010330003 |
5 | 3212101400403231 |
6 | 120250431310031 |
7 | 10423624415320 |
oct | 1422143047403 |
9 | 332327517721 |
10 | 105521106691 |
11 | 40829a062a0 |
12 | 1854a97b317 |
13 | 9c48603490 |
14 | 517040db47 |
15 | 2b28cc8161 |
hex | 18918c4f03 |
105521106691 has 32 divisors (see below), whose sum is σ = 150012753408. Its totient is φ = 71434621440.
The previous prime is 105521106673. The next prime is 105521106701. The reversal of 105521106691 is 196601125501.
It is not a de Polignac number, because 105521106691 - 225 = 105487552259 is a prime.
It is a super-2 number, since 2×1055211066912 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105521106691.
It is not an unprimeable number, because it can be changed into a prime (105521106601) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3083445 + ... + 3117478.
It is an arithmetic number, because the mean of its divisors is an integer number (4687898544).
Almost surely, 2105521106691 is an apocalyptic number.
105521106691 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105521106691 is a deficient number, since it is larger than the sum of its proper divisors (44491646717).
105521106691 is a wasteful number, since it uses less digits than its factorization.
105521106691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6200971.
The product of its (nonzero) digits is 16200, while the sum is 37.
It can be divided in two parts, 105521 and 106691, that added together give a palindrome (212212).
The spelling of 105521106691 in words is "one hundred five billion, five hundred twenty-one million, one hundred six thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •