Base | Representation |
---|---|
bin | 100100110000100000… |
… | …000000111001110101 |
3 | 10202212121202200100101 |
4 | 210300200000321311 |
5 | 1121312402414331 |
6 | 30044224514101 |
7 | 2565030621142 |
oct | 446040007165 |
9 | 122777680311 |
10 | 39468404341 |
11 | 15813981393 |
12 | 7795a7b931 |
13 | 394cbb7112 |
14 | 1ca5b4d3c9 |
15 | 105eecc061 |
hex | 930800e75 |
39468404341 has 8 divisors (see below), whose sum is σ = 41777791200. Its totient is φ = 37182227760.
The previous prime is 39468404293. The next prime is 39468404401. The reversal of 39468404341 is 14340486493.
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 39468404341 - 215 = 39468371573 is a prime.
It is a super-3 number, since 3×394684043413 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 39468404291 and 39468404300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39468402341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5799070 + ... + 5805871.
It is an arithmetic number, because the mean of its divisors is an integer number (5222223900).
Almost surely, 239468404341 is an apocalyptic number.
It is an amenable number.
39468404341 is a deficient number, since it is larger than the sum of its proper divisors (2309386859).
39468404341 is a wasteful number, since it uses less digits than its factorization.
39468404341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11605139.
The product of its (nonzero) digits is 995328, while the sum is 46.
The spelling of 39468404341 in words is "thirty-nine billion, four hundred sixty-eight million, four hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •