Base | Representation |
---|---|
bin | 110001110010010000… |
… | …1001101000011011011 |
3 | 101012221221220110100111 |
4 | 1203210201031003123 |
5 | 3222424224441241 |
6 | 121040515145151 |
7 | 10503256364431 |
oct | 1434441150333 |
9 | 335857813314 |
10 | 106913124571 |
11 | 413837429a0 |
12 | 18878ba51b7 |
13 | a10ab189b6 |
14 | 5263244d51 |
15 | 2bab0e2c81 |
hex | 18e484d0db |
106913124571 has 8 divisors (see below), whose sum is σ = 116829188784. Its totient is φ = 97029841920.
The previous prime is 106913124569. The next prime is 106913124587. The reversal of 106913124571 is 175421319601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106913124571 - 21 = 106913124569 is a prime.
It is a super-2 number, since 2×1069131245712 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106913124551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8188566 + ... + 8201611.
It is an arithmetic number, because the mean of its divisors is an integer number (14603648598).
Almost surely, 2106913124571 is an apocalyptic number.
106913124571 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106913124571 is a deficient number, since it is larger than the sum of its proper divisors (9916064213).
106913124571 is a wasteful number, since it uses less digits than its factorization.
106913124571 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16390781.
The product of its (nonzero) digits is 45360, while the sum is 40.
The spelling of 106913124571 in words is "one hundred six billion, nine hundred thirteen million, one hundred twenty-four thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •