Base | Representation |
---|---|
bin | 10010000011100110111… |
… | …01111001000100101101 |
3 | 2012022101121120211011021 |
4 | 21001303131321010231 |
5 | 40131101100201123 |
6 | 1153002533054141 |
7 | 62552254202350 |
oct | 11016335710455 |
9 | 2168347524137 |
10 | 620412506413 |
11 | 21a12a75a807 |
12 | a02a6a87351 |
13 | 4667393507b |
14 | 22057268297 |
15 | 11211e1cc5d |
hex | 907377912d |
620412506413 has 8 divisors (see below), whose sum is σ = 715547845760. Its totient is φ = 526903412400.
The previous prime is 620412506393. The next prime is 620412506431. The reversal of 620412506413 is 314605214026.
620412506413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-620412506413 is a prime.
It is a super-2 number, since 2×6204125064132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620412506113) 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, 406560513 + ... + 406562038.
It is an arithmetic number, because the mean of its divisors is an integer number (89443480720).
Almost surely, 2620412506413 is an apocalyptic number.
It is an amenable number.
620412506413 is a deficient number, since it is larger than the sum of its proper divisors (95135339347).
620412506413 is a wasteful number, since it uses less digits than its factorization.
620412506413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 813122667.
The product of its (nonzero) digits is 34560, while the sum is 34.
The spelling of 620412506413 in words is "six hundred twenty billion, four hundred twelve million, five hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •