Base | Representation |
---|---|
bin | 110001001001001111… |
… | …0011010011110100011 |
3 | 101002102000211212212110 |
4 | 1202102132122132203 |
5 | 3212114341131121 |
6 | 120252144530403 |
7 | 10424203551336 |
oct | 1422236323643 |
9 | 332360755773 |
10 | 105536661411 |
11 | 4083776a835 |
12 | 18554020a03 |
13 | 9c4b8bb45c |
14 | 51724dc61d |
15 | 2b2a34bd76 |
hex | 189279a7a3 |
105536661411 has 8 divisors (see below), whose sum is σ = 140812000960. Its totient is φ = 70309548072.
The previous prime is 105536661397. The next prime is 105536661457. The reversal of 105536661411 is 114166635501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105536661411 - 29 = 105536660899 is a prime.
It is a super-2 number, since 2×1055366614112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105536661411.
It is not an unprimeable number, because it can be changed into a prime (105536661211) 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, 12051445 + ... + 12060198.
It is an arithmetic number, because the mean of its divisors is an integer number (17601500120).
Almost surely, 2105536661411 is an apocalyptic number.
105536661411 is a deficient number, since it is larger than the sum of its proper divisors (35275339549).
105536661411 is a wasteful number, since it uses less digits than its factorization.
105536661411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24113105.
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 105536661411 in words is "one hundred five billion, five hundred thirty-six million, six hundred sixty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •