Base | Representation |
---|---|
bin | 1001010001001101101011010… |
… | …1101110101010010010000001 |
3 | 10011112102001022110101101001102 |
4 | 2110103122311232222102001 |
5 | 1140442342010314204212 |
6 | 10231113215413144145 |
7 | 254246113236415103 |
oct | 22423326556522201 |
9 | 3145361273341042 |
10 | 652245372413057 |
11 | 1799097887a8545 |
12 | 611a163362b055 |
13 | 21cc3622bc7007 |
14 | b70cbb72d9573 |
15 | 50615eb7325c2 |
hex | 25136b5baa481 |
652245372413057 has 32 divisors (see below), whose sum is σ = 696164382950400. Its totient is φ = 609987792648960.
The previous prime is 652245372412999. The next prime is 652245372413077. The reversal of 652245372413057 is 750314273542256.
It is not a de Polignac number, because 652245372413057 - 26 = 652245372412993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 652245372412993 and 652245372413011.
It is not an unprimeable number, because it can be changed into a prime (652245372413077) 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 31 ways as a sum of consecutive naturals, for example, 3151860563 + ... + 3152067495.
It is an arithmetic number, because the mean of its divisors is an integer number (21755136967200).
Almost surely, 2652245372413057 is an apocalyptic number.
It is an amenable number.
652245372413057 is a deficient number, since it is larger than the sum of its proper divisors (43919010537343).
652245372413057 is a wasteful number, since it uses less digits than its factorization.
652245372413057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225593.
The product of its (nonzero) digits is 42336000, while the sum is 56.
The spelling of 652245372413057 in words is "six hundred fifty-two trillion, two hundred forty-five billion, three hundred seventy-two million, four hundred thirteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •