Base | Representation |
---|---|
bin | 110001101100111111… |
… | …0011101001101011011 |
3 | 101012111122001222012110 |
4 | 1203121332131031123 |
5 | 3222043434243142 |
6 | 121011200043403 |
7 | 10466011046343 |
oct | 1433176351533 |
9 | 335448058173 |
10 | 106736243547 |
11 | 412a291062a |
12 | 18829903563 |
13 | a0b029767b |
14 | 524795dd23 |
15 | 2b9a80399c |
hex | 18d9f9d35b |
106736243547 has 16 divisors (see below), whose sum is σ = 142918778880. Its totient is φ = 70856208192.
The previous prime is 106736243521. The next prime is 106736243557. The reversal of 106736243547 is 745342637601.
It is not a de Polignac number, because 106736243547 - 220 = 106735194971 is a prime.
It is a super-2 number, since 2×1067362435472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106736243496 and 106736243505.
It is not an unprimeable number, because it can be changed into a prime (106736243557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 633654 + ... + 784212.
It is an arithmetic number, because the mean of its divisors is an integer number (8932423680).
Almost surely, 2106736243547 is an apocalyptic number.
106736243547 is a deficient number, since it is larger than the sum of its proper divisors (36182535333).
106736243547 is a wasteful number, since it uses less digits than its factorization.
106736243547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151562.
The product of its (nonzero) digits is 2540160, while the sum is 48.
The spelling of 106736243547 in words is "one hundred six billion, seven hundred thirty-six million, two hundred forty-three thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •