Base | Representation |
---|---|
bin | 110001011010010111… |
… | …1101001101001101001 |
3 | 101010220002201001200112 |
4 | 1202310233221221221 |
5 | 3214304032332403 |
6 | 120425203544105 |
7 | 10444354522625 |
oct | 1426457515151 |
9 | 333802631615 |
10 | 106111605353 |
11 | 41002264716 |
12 | 1869468b035 |
13 | a010a53480 |
14 | 51c8a02185 |
15 | 2b60a6a9d8 |
hex | 18b4be9a69 |
106111605353 has 8 divisors (see below), whose sum is σ = 114283602048. Its totient is φ = 97940975184.
The previous prime is 106111605349. The next prime is 106111605361. The reversal of 106111605353 is 353506111601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106111605353 - 22 = 106111605349 is a prime.
It is a super-2 number, since 2×1061116053532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106111605323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 177425 + ... + 493662.
It is an arithmetic number, because the mean of its divisors is an integer number (14285450256).
Almost surely, 2106111605353 is an apocalyptic number.
106111605353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106111605353 is a deficient number, since it is larger than the sum of its proper divisors (8171996695).
106111605353 is a wasteful number, since it uses less digits than its factorization.
106111605353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 683263.
The product of its (nonzero) digits is 8100, while the sum is 32.
Adding to 106111605353 its reverse (353506111601), we get a palindrome (459617716954).
The spelling of 106111605353 in words is "one hundred six billion, one hundred eleven million, six hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •