Base | Representation |
---|---|
bin | 10010000011010100010… |
… | …01101111111111110101 |
3 | 2012021222201112020011022 |
4 | 21001222021233333311 |
5 | 40130241043401123 |
6 | 1152535231350525 |
7 | 62545345656200 |
oct | 11015211577765 |
9 | 2167881466138 |
10 | 620256231413 |
11 | 21a05a522015 |
12 | a0262682445 |
13 | 4664a449c60 |
14 | 220405c8937 |
15 | 1120334e1c8 |
hex | 906a26fff5 |
620256231413 has 24 divisors (see below), whose sum is σ = 777373426872. Its totient is φ = 490531676544.
The previous prime is 620256231383. The next prime is 620256231449. The reversal of 620256231413 is 314132652026.
It can be written as a sum of positive squares in 4 ways, for example, as 26558243089 + 593697988324 = 162967^2 + 770518^2 .
It is not a de Polignac number, because 620256231413 - 210 = 620256230389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620256239413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1207331 + ... + 1642607.
It is an arithmetic number, because the mean of its divisors is an integer number (32390559453).
Almost surely, 2620256231413 is an apocalyptic number.
It is an amenable number.
620256231413 is a deficient number, since it is larger than the sum of its proper divisors (157117195459).
620256231413 is a wasteful number, since it uses less digits than its factorization.
620256231413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437541 (or 437534 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 620256231413 its reverse (314132652026), we get a palindrome (934388883439).
The spelling of 620256231413 in words is "six hundred twenty billion, two hundred fifty-six million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •