Base | Representation |
---|---|
bin | 10010111001001000001… |
… | …11101001000000000000 |
3 | 2022001120002210210021111 |
4 | 21130210013221000000 |
5 | 41113422341410131 |
6 | 1214114044333104 |
7 | 64620305223232 |
oct | 11344407510000 |
9 | 2261502723244 |
10 | 649146044416 |
11 | 230335023131 |
12 | a5985844194 |
13 | 492a280566c |
14 | 235c1402252 |
15 | 11d4477dab1 |
hex | 97241e9000 |
649146044416 has 39 divisors (see below), whose sum is σ = 1298236730601. Its totient is φ = 324547239936.
The previous prime is 649146044399. The next prime is 649146044431. The reversal of 649146044416 is 614440641946.
The square root of 649146044416 is 805696.
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., 53409058816 + 595736985600 = 231104^2 + 771840^2 .
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 649146044416.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 51558250 + ... + 51570838.
Almost surely, 2649146044416 is an apocalyptic number.
649146044416 is the 805696-th square number.
It is an amenable number.
649146044416 is a deficient number, since it is larger than the sum of its proper divisors (649090686185).
649146044416 is an frugal number, since it uses more digits than its factorization.
649146044416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25202 (or 12591 counting only the distinct ones).
The product of its (nonzero) digits is 1990656, while the sum is 49.
Multiplying 649146044416 by its sum of digits (49), we get a square (31808156176384 = 56398722).
The spelling of 649146044416 in words is "six hundred forty-nine billion, one hundred forty-six million, forty-four thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •