Base | Representation |
---|---|
bin | 110000110000101001… |
… | …1100101100000011100 |
3 | 101000021112121111122010 |
4 | 1201201103211200130 |
5 | 3203422201130140 |
6 | 120034235551220 |
7 | 10364566046061 |
oct | 1414123454034 |
9 | 330245544563 |
10 | 104711739420 |
11 | 40454057722 |
12 | 183638bb510 |
13 | 9b49a20a32 |
14 | 50d4b26c68 |
15 | 2accc00880 |
hex | 18614e581c |
104711739420 has 144 divisors (see below), whose sum is σ = 309852230688. Its totient is φ = 26417940480.
The previous prime is 104711739413. The next prime is 104711739421. The reversal of 104711739420 is 24937117401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104711739421) 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, 18559800 + ... + 18565440.
It is an arithmetic number, because the mean of its divisors is an integer number (2151751602).
Almost surely, 2104711739420 is an apocalyptic number.
104711739420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104711739420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154926115344).
104711739420 is an abundant number, since it is smaller than the sum of its proper divisors (205140491268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104711739420 is a wasteful number, since it uses less digits than its factorization.
104711739420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6548 (or 6527 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 39.
The spelling of 104711739420 in words is "one hundred four billion, seven hundred eleven million, seven hundred thirty-nine thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •