Base | Representation |
---|---|
bin | 110001100000011000… |
… | …1110111111100010001 |
3 | 101011102011122010100001 |
4 | 1203000301313330101 |
5 | 3220212224433034 |
6 | 120501215330001 |
7 | 10452355652050 |
oct | 1430061677421 |
9 | 334364563301 |
10 | 106313514769 |
11 | 410a6231200 |
12 | 18730220901 |
13 | a0438288b7 |
14 | 5207760397 |
15 | 2b73650a14 |
hex | 18c0c77f11 |
106313514769 has 48 divisors (see below), whose sum is σ = 139750458624. Its totient is φ = 79080693120.
The previous prime is 106313514719. The next prime is 106313514773. The reversal of 106313514769 is 967415313601.
It is not a de Polignac number, because 106313514769 - 227 = 106179297041 is a prime.
It is a super-2 number, since 2×1063135147692 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (106313514709) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1628964 + ... + 1692970.
It is an arithmetic number, because the mean of its divisors is an integer number (2911467888).
Almost surely, 2106313514769 is an apocalyptic number.
It is an amenable number.
106313514769 is a deficient number, since it is larger than the sum of its proper divisors (33436943855).
106313514769 is a wasteful number, since it uses less digits than its factorization.
106313514769 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64126 (or 64115 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 46.
It can be divided in two parts, 1063135147 and 69, that added together give a triangular number (1063135216 = T46111).
The spelling of 106313514769 in words is "one hundred six billion, three hundred thirteen million, five hundred fourteen thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •