Base | Representation |
---|---|
bin | 110000011000101001011100… |
… | …1001101000101111110110001 |
3 | 2001210220222000012221200020221 |
4 | 1200301102321031011332301 |
5 | 421241012303131400221 |
6 | 4105101535511333041 |
7 | 155434404625640446 |
oct | 14061227115057661 |
9 | 2053828005850227 |
10 | 425600006512561 |
11 | 113677a49341771 |
12 | 3b898171081181 |
13 | 15362ba69c361a |
14 | 77152163099cd |
15 | 3430c75ddd541 |
hex | 18314b9345fb1 |
425600006512561 has 16 divisors (see below), whose sum is σ = 441443266346880. Its totient is φ = 410041361710720.
The previous prime is 425600006512517. The next prime is 425600006512609. The reversal of 425600006512561 is 165215600006524.
It is a cyclic number.
It is not a de Polignac number, because 425600006512561 - 211 = 425600006510513 is a prime.
It is a super-2 number, since 2×4256000065125612 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (425600006519561) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 151628101 + ... + 154409458.
It is an arithmetic number, because the mean of its divisors is an integer number (27590204146680).
Almost surely, 2425600006512561 is an apocalyptic number.
425600006512561 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
425600006512561 is a deficient number, since it is larger than the sum of its proper divisors (15843259834319).
425600006512561 is a wasteful number, since it uses less digits than its factorization.
425600006512561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306038024.
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 425600006512561 in words is "four hundred twenty-five trillion, six hundred billion, six million, five hundred twelve thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •