Base | Representation |
---|---|
bin | 100101000111110000… |
… | …1110111000110000110 |
3 | 21121202122102000100000 |
4 | 1022033201313012012 |
5 | 2301230130222023 |
6 | 100342141102130 |
7 | 5521320654210 |
oct | 1121741670606 |
9 | 247678360300 |
10 | 79717429638 |
11 | 30898457860 |
12 | 13549257946 |
13 | 769572a512 |
14 | 3c034215b0 |
15 | 21187a4243 |
hex | 128f877186 |
79717429638 has 192 divisors, whose sum is σ = 227535340032. Its totient is φ = 20314644480.
The previous prime is 79717429633. The next prime is 79717429657. The reversal of 79717429638 is 83692471797.
It is a super-2 number, since 2×797174296382 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (79717429633) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1963270 + ... + 2003462.
It is an arithmetic number, because the mean of its divisors is an integer number (1185079896).
Almost surely, 279717429638 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 79717429638, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113767670016).
79717429638 is an abundant number, since it is smaller than the sum of its proper divisors (147817910394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
79717429638 is a wasteful number, since it uses less digits than its factorization.
79717429638 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40281 (or 40269 counting only the distinct ones).
The product of its digits is 32006016, while the sum is 63.
The spelling of 79717429638 in words is "seventy-nine billion, seven hundred seventeen million, four hundred twenty-nine thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •