Base | Representation |
---|---|
bin | 110001011110010010… |
… | …1011010000001000111 |
3 | 101011020021012121000111 |
4 | 1202330211122001013 |
5 | 3220041220400412 |
6 | 120450223053451 |
7 | 10450542524605 |
oct | 1427445320107 |
9 | 334207177014 |
10 | 106243137607 |
11 | 4106a532862 |
12 | 18710741287 |
13 | a0320874c9 |
14 | 51dc280875 |
15 | 2b6c39d2a7 |
hex | 18bc95a047 |
106243137607 has 4 divisors (see below), whose sum is σ = 106245035776. Its totient is φ = 106241239440.
The previous prime is 106243137589. The next prime is 106243137613. The reversal of 106243137607 is 706731342601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106243137607 - 227 = 106108919879 is a prime.
It is a super-2 number, since 2×1062431376072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106243137607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106246137607) 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 3 ways as a sum of consecutive naturals, for example, 862494 + ... + 977947.
It is an arithmetic number, because the mean of its divisors is an integer number (26561258944).
Almost surely, 2106243137607 is an apocalyptic number.
106243137607 is a deficient number, since it is larger than the sum of its proper divisors (1898169).
106243137607 is an equidigital number, since it uses as much as digits as its factorization.
106243137607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1898168.
The product of its (nonzero) digits is 127008, while the sum is 40.
The spelling of 106243137607 in words is "one hundred six billion, two hundred forty-three million, one hundred thirty-seven thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •