Base | Representation |
---|---|
bin | 110001010110011000… |
… | …1101110011010010011 |
3 | 101010112210011201111210 |
4 | 1202230301232122103 |
5 | 3214020322301121 |
6 | 120404030511203 |
7 | 10441142360652 |
oct | 1425461563223 |
9 | 333483151453 |
10 | 105977931411 |
11 | 40a43863490 |
12 | 18657965503 |
13 | 9cbc14c671 |
14 | 51b4d67199 |
15 | 2b53e63876 |
hex | 18acc6e693 |
105977931411 has 8 divisors (see below), whose sum is σ = 154149718464. Its totient is φ = 64229049320.
The previous prime is 105977931403. The next prime is 105977931431. The reversal of 105977931411 is 114139779501.
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 105977931411 - 23 = 105977931403 is a prime.
It is a super-2 number, since 2×1059779314112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105977931431) 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, 1605726201 + ... + 1605726266.
It is an arithmetic number, because the mean of its divisors is an integer number (19268714808).
Almost surely, 2105977931411 is an apocalyptic number.
105977931411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105977931411 is a deficient number, since it is larger than the sum of its proper divisors (48171787053).
105977931411 is a wasteful number, since it uses less digits than its factorization.
105977931411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3211452481.
The product of its (nonzero) digits is 238140, while the sum is 48.
The spelling of 105977931411 in words is "one hundred five billion, nine hundred seventy-seven million, nine hundred thirty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •