Base | Representation |
---|---|
bin | 100101010001011… |
… | …011010110000001 |
3 | 1121120122211020112 |
4 | 211101123112001 |
5 | 2240040403231 |
6 | 142014521105 |
7 | 21332115146 |
oct | 4521332601 |
9 | 1546584215 |
10 | 625325441 |
11 | 2a0a86294 |
12 | 155506195 |
13 | 9c724c70 |
14 | 5d09a3cd |
15 | 39d7192b |
hex | 2545b581 |
625325441 has 16 divisors (see below), whose sum is σ = 686605248. Its totient is φ = 566040000.
The previous prime is 625325411. The next prime is 625325489. The reversal of 625325441 is 144523526.
It is a cyclic number.
It is not a de Polignac number, because 625325441 - 26 = 625325377 is a prime.
It is a super-4 number, since 4×6253254414 (a number of 36 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 625325398 and 625325407.
It is not an unprimeable number, because it can be changed into a prime (625325411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138266 + ... + 142716.
It is an arithmetic number, because the mean of its divisors is an integer number (42912828).
Almost surely, 2625325441 is an apocalyptic number.
It is an amenable number.
625325441 is a deficient number, since it is larger than the sum of its proper divisors (61279807).
625325441 is a wasteful number, since it uses less digits than its factorization.
625325441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4672.
The product of its digits is 28800, while the sum is 32.
The square root of 625325441 is about 25006.5079729258. The cubic root of 625325441 is about 855.1363465969.
Adding to 625325441 its reverse (144523526), we get a palindrome (769848967).
The spelling of 625325441 in words is "six hundred twenty-five million, three hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •