Base | Representation |
---|---|
bin | 100110101101011… |
… | …001010010010000 |
3 | 1200021000200022121 |
4 | 212231121102100 |
5 | 2312223344011 |
6 | 144235344024 |
7 | 22044046222 |
oct | 4655312220 |
9 | 1607020277 |
10 | 649434256 |
11 | 303652629 |
12 | 1615b2014 |
13 | a4716633 |
14 | 62374412 |
15 | 3c034e71 |
hex | 26b59490 |
649434256 has 45 divisors (see below), whose sum is σ = 1320131001. Its totient is φ = 309477696.
The previous prime is 649434241. The next prime is 649434257. The reversal of 649434256 is 652434946.
It is a happy number.
The square root of 649434256 is 25484.
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., 111936400 + 537497856 = 10580^2 + 23184^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (649434257) 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 8 ways as a sum of consecutive naturals, for example, 2344390 + ... + 2344666.
Almost surely, 2649434256 is an apocalyptic number.
649434256 is the 25484-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 649434256
649434256 is an abundant number, since it is smaller than the sum of its proper divisors (670696745).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
649434256 is an equidigital number, since it uses as much as digits as its factorization.
649434256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608 (or 302 counting only the distinct ones).
The product of its digits is 622080, while the sum is 43.
The cubic root of 649434256 is about 865.9877146605.
The spelling of 649434256 in words is "six hundred forty-nine million, four hundred thirty-four thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •