Base | Representation |
---|---|
bin | 110001100000011000… |
… | …1110111111100011001 |
3 | 101011102011122010100100 |
4 | 1203000301313330121 |
5 | 3220212224433102 |
6 | 120501215330013 |
7 | 10452355652061 |
oct | 1430061677431 |
9 | 334364563310 |
10 | 106313514777 |
11 | 410a6231208 |
12 | 18730220909 |
13 | a0438288c2 |
14 | 52077603a1 |
15 | 2b73650a1c |
hex | 18c0c77f19 |
106313514777 has 6 divisors (see below), whose sum is σ = 153563965802. Its totient is φ = 70875676512.
The previous prime is 106313514773. The next prime is 106313514779. The reversal of 106313514777 is 777415313601.
106313514777 is a `hidden beast` number, since 1 + 0 + 63 + 1 + 3 + 514 + 7 + 77 = 666.
It can be written as a sum of positive squares in only one way, i.e., 99313849881 + 6999664896 = 315141^2 + 83664^2 .
It is not a de Polignac number, because 106313514777 - 22 = 106313514773 is a prime.
It is a super-2 number, since 2×1063135147772 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106313514773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5906306368 + ... + 5906306385.
Almost surely, 2106313514777 is an apocalyptic number.
It is an amenable number.
106313514777 is a deficient number, since it is larger than the sum of its proper divisors (47250451025).
106313514777 is a wasteful number, since it uses less digits than its factorization.
106313514777 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11812612759 (or 11812612756 counting only the distinct ones).
The product of its (nonzero) digits is 370440, while the sum is 45.
The spelling of 106313514777 in words is "one hundred six billion, three hundred thirteen million, five hundred fourteen thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •