Base | Representation |
---|---|
bin | 10010101000001000101… |
… | …11101101001110011101 |
3 | 2021012000100001000001200 |
4 | 21110010113231032131 |
5 | 40441232000404100 |
6 | 1210004523430113 |
7 | 64145243365464 |
oct | 11240427551635 |
9 | 2235010030050 |
10 | 640023450525 |
11 | 227483609338 |
12 | a405a685339 |
13 | 4847a830904 |
14 | 22d979d79db |
15 | 119ad937e00 |
hex | 95045ed39d |
640023450525 has 144 divisors (see below), whose sum is σ = 1175336023680. Its totient is φ = 332852889600.
The previous prime is 640023450523. The next prime is 640023450551. The reversal of 640023450525 is 525054320046.
640023450525 is a `hidden beast` number, since 64 + 0 + 0 + 23 + 4 + 50 + 525 = 666.
640023450525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 640023450525 - 21 = 640023450523 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 640023450525.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (640023450523) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 602091144 + ... + 602092206.
It is an arithmetic number, because the mean of its divisors is an integer number (8162055720).
Almost surely, 2640023450525 is an apocalyptic number.
It is an amenable number.
640023450525 is a deficient number, since it is larger than the sum of its proper divisors (535312573155).
640023450525 is a wasteful number, since it uses less digits than its factorization.
640023450525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1556 (or 1548 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 36.
The spelling of 640023450525 in words is "six hundred forty billion, twenty-three million, four hundred fifty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •