Base | Representation |
---|---|
bin | 111010110001111000… |
… | …110011100011110001 |
3 | 20000220112010102112201 |
4 | 322301320303203301 |
5 | 2013224141010000 |
6 | 44554424023201 |
7 | 4363011103504 |
oct | 726170634361 |
9 | 200815112481 |
10 | 63114000625 |
11 | 248482318a5 |
12 | 10294901b01 |
13 | 5c4a947a00 |
14 | 30aa29313b |
15 | 1995d1496a |
hex | eb1e338f1 |
63114000625 has 45 divisors (see below), whose sum is σ = 85511259669. Its totient is φ = 46546968000.
The previous prime is 63114000601. The next prime is 63114000667. The reversal of 63114000625 is 52600041136.
The square root of 63114000625 is 251225.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 22 ways, for example, as 8084347569 + 55029653056 = 89913^2 + 234584^2 .
It is not a de Polignac number, because 63114000625 - 213 = 63113992433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63114000593 and 63114000602.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 81647739 + ... + 81648511.
Almost surely, 263114000625 is an apocalyptic number.
63114000625 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
63114000625 is the 251225-th square number.
63114000625 is the 125613-rd centered octagonal number.
It is an amenable number.
63114000625 is a deficient number, since it is larger than the sum of its proper divisors (22397259044).
63114000625 is an frugal number, since it uses more digits than its factorization.
63114000625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1592 (or 791 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The spelling of 63114000625 in words is "sixty-three billion, one hundred fourteen million, six hundred twenty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •