Base | Representation |
---|---|
bin | 100110101111100… |
… | …010001100010001 |
3 | 1200022002011112211 |
4 | 212233202030101 |
5 | 2312344320100 |
6 | 144255352121 |
7 | 22051603141 |
oct | 4657421421 |
9 | 1608064484 |
10 | 649995025 |
11 | 3039a5979 |
12 | 161822641 |
13 | a4881954 |
14 | 6247c921 |
15 | 3c0e61ba |
hex | 26be2311 |
649995025 has 9 divisors (see below), whose sum is σ = 806151931. Its totient is φ = 519894040.
The previous prime is 649995023. The next prime is 649995029. The reversal of 649995025 is 520599946.
The square root of 649995025 is 25495.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 233998209 + 415996816 = 15297^2 + 20396^2 .
It is not a de Polignac number, because 649995025 - 21 = 649995023 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 649995025.
It is not an unprimeable number, because it can be changed into a prime (649995023) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 124926 + ... + 130024.
Almost surely, 2649995025 is an apocalyptic number.
649995025 is the 25495-th square number.
649995025 is the 12748-th centered octagonal number.
It is an amenable number.
649995025 is a deficient number, since it is larger than the sum of its proper divisors (156156906).
649995025 is an frugal number, since it uses more digits than its factorization.
649995025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10208 (or 5104 counting only the distinct ones).
The product of its (nonzero) digits is 874800, while the sum is 49.
The cubic root of 649995025 is about 866.2368953150.
Multiplying 649995025 by its sum of digits (49), we get a square (31849756225 = 1784652).
The spelling of 649995025 in words is "six hundred forty-nine million, nine hundred ninety-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •