Base | Representation |
---|---|
bin | 110000110010001000… |
… | …0101011010111000101 |
3 | 101000101222212212210011 |
4 | 1201210100223113011 |
5 | 3204022343333423 |
6 | 120043210230221 |
7 | 10366040300503 |
oct | 1414420532705 |
9 | 330358785704 |
10 | 104761308613 |
11 | 4047a0337a5 |
12 | 18378425371 |
13 | 9b57088010 |
14 | 50db54b673 |
15 | 2ad2242b0d |
hex | 186442b5c5 |
104761308613 has 8 divisors (see below), whose sum is σ = 112823362008. Its totient is φ = 96699753984.
The previous prime is 104761308601. The next prime is 104761308649. The reversal of 104761308613 is 316803167401.
It can be written as a sum of positive squares in 4 ways, for example, as 16461403204 + 88299905409 = 128302^2 + 297153^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104761308613 - 217 = 104761177541 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104761303613) 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, 390381 + ... + 601597.
It is an arithmetic number, because the mean of its divisors is an integer number (14102920251).
Almost surely, 2104761308613 is an apocalyptic number.
104761308613 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
104761308613 is a deficient number, since it is larger than the sum of its proper divisors (8062053395).
104761308613 is a wasteful number, since it uses less digits than its factorization.
104761308613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249383.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 104761308613 in words is "one hundred four billion, seven hundred sixty-one million, three hundred eight thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •