Base | Representation |
---|---|
bin | 110001101100010010… |
… | …1111110011010111101 |
3 | 101012110000102112221110 |
4 | 1203120211332122331 |
5 | 3222022020030030 |
6 | 121005010552233 |
7 | 10465306643151 |
oct | 1433045763275 |
9 | 335400375843 |
10 | 106713048765 |
11 | 41290808a94 |
12 | 18821b98679 |
13 | a0a853604b |
14 | 5244843061 |
15 | 2b987711b0 |
hex | 18d897e6bd |
106713048765 has 8 divisors (see below), whose sum is σ = 170740878048. Its totient is φ = 56913626000.
The previous prime is 106713048763. The next prime is 106713048809. The reversal of 106713048765 is 567840317601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106713048765 - 21 = 106713048763 is a prime.
It is a super-2 number, since 2×1067130487652 (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 (106713048763) 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, 3557101611 + ... + 3557101640.
It is an arithmetic number, because the mean of its divisors is an integer number (21342609756).
Almost surely, 2106713048765 is an apocalyptic number.
106713048765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106713048765 is a deficient number, since it is larger than the sum of its proper divisors (64027829283).
106713048765 is an equidigital number, since it uses as much as digits as its factorization.
106713048765 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7114203259.
The product of its (nonzero) digits is 846720, while the sum is 48.
The spelling of 106713048765 in words is "one hundred six billion, seven hundred thirteen million, forty-eight thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •