Base | Representation |
---|---|
bin | 110001101001011010… |
… | …0111010100011010101 |
3 | 101012012021101022000211 |
4 | 1203102310322203111 |
5 | 3221322233124111 |
6 | 120551233205421 |
7 | 10463023420033 |
oct | 1432264724325 |
9 | 335167338024 |
10 | 106616301781 |
11 | 41241139600 |
12 | 187b5700871 |
13 | a091491102 |
14 | 5235a5b553 |
15 | 2b90010521 |
hex | 18d2d3a8d5 |
106616301781 has 24 divisors (see below), whose sum is σ = 118387188920. Its totient is φ = 95935466880.
The previous prime is 106616301767. The next prime is 106616301811. The reversal of 106616301781 is 187103616601.
It can be written as a sum of positive squares in 4 ways, for example, as 8678599281 + 97937702500 = 93159^2 + 312950^2 .
It is not a de Polignac number, because 106616301781 - 29 = 106616301269 is a prime.
It is a super-2 number, since 2×1066163017812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106616301731) 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 23 ways as a sum of consecutive naturals, for example, 14728495 + ... + 14735731.
Almost surely, 2106616301781 is an apocalyptic number.
106616301781 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106616301781 is a deficient number, since it is larger than the sum of its proper divisors (11770887139).
106616301781 is a wasteful number, since it uses less digits than its factorization.
106616301781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8485 (or 8474 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 40.
The spelling of 106616301781 in words is "one hundred six billion, six hundred sixteen million, three hundred one thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •