Base | Representation |
---|---|
bin | 1011011100000100011… |
… | …01100101101110011101 |
3 | 1101120110200221012000221 |
4 | 11232002031211232131 |
5 | 22414404303440123 |
6 | 500315352321341 |
7 | 40252365120643 |
oct | 5560215455635 |
9 | 1346420835027 |
10 | 393026624413 |
11 | 141755313085 |
12 | 642079a3251 |
13 | 2b0a69c7ab7 |
14 | 15045db7193 |
15 | a3545dd25d |
hex | 5b82365b9d |
393026624413 has 8 divisors (see below), whose sum is σ = 393403132760. Its totient is φ = 392650251840.
The previous prime is 393026624387. The next prime is 393026624483. The reversal of 393026624413 is 314426620393.
It can be written as a sum of positive squares in 4 ways, for example, as 55444708089 + 337581916324 = 235467^2 + 581018^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 393026624413 - 217 = 393026493341 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 393026624413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (393026624483) 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, 6317503 + ... + 6379411.
It is an arithmetic number, because the mean of its divisors is an integer number (49175391595).
Almost surely, 2393026624413 is an apocalyptic number.
It is an amenable number.
393026624413 is a deficient number, since it is larger than the sum of its proper divisors (376508347).
393026624413 is a wasteful number, since it uses less digits than its factorization.
393026624413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67887.
The product of its (nonzero) digits is 559872, while the sum is 43.
The spelling of 393026624413 in words is "three hundred ninety-three billion, twenty-six million, six hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •