Base | Representation |
---|---|
bin | 100101001011111111… |
… | …101000001111100000 |
3 | 10211001202201202011100 |
4 | 211023333220033200 |
5 | 1123233444124033 |
6 | 30202103314400 |
7 | 2612331436542 |
oct | 451377501740 |
9 | 124052652140 |
10 | 39929676768 |
11 | 15a30297173 |
12 | 78a444ba00 |
13 | 39c462c897 |
14 | 1d0b103692 |
15 | 108a745513 |
hex | 94bfe83e0 |
39929676768 has 36 divisors (see below), whose sum is σ = 113550019128. Its totient is φ = 13309892160.
The previous prime is 39929676767. The next prime is 39929676779. The reversal of 39929676768 is 86767692993.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 39929676696 and 39929676705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39929676767) 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, 69322068 + ... + 69322643.
It is an arithmetic number, because the mean of its divisors is an integer number (3154167198).
Almost surely, 239929676768 is an apocalyptic number.
It is an amenable number.
39929676768 is an abundant number, since it is smaller than the sum of its proper divisors (73620342360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39929676768 is a wasteful number, since it uses less digits than its factorization.
39929676768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138644727 (or 138644716 counting only the distinct ones).
The product of its digits is 370355328, while the sum is 72.
The spelling of 39929676768 in words is "thirty-nine billion, nine hundred twenty-nine million, six hundred seventy-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •