Base | Representation |
---|---|
bin | 100110101101000… |
… | …101111101010000 |
3 | 1200020212122201110 |
4 | 212231011331100 |
5 | 2312213330323 |
6 | 144233533320 |
7 | 22043266344 |
oct | 4655057520 |
9 | 1606778643 |
10 | 649355088 |
11 | 3035a90a8 |
12 | 161574240 |
13 | a46b95a5 |
14 | 62353624 |
15 | 3c01b793 |
hex | 26b45f50 |
649355088 has 40 divisors (see below), whose sum is σ = 1678740768. Its totient is φ = 216291712.
The previous prime is 649355081. The next prime is 649355093. The reversal of 649355088 is 880553946.
It is a happy number.
649355088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6493550882 = 843324060622975488, which contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (649355081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73231 + ... + 81617.
Almost surely, 2649355088 is an apocalyptic number.
It is an amenable number.
649355088 is an abundant number, since it is smaller than the sum of its proper divisors (1029385680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
649355088 is a wasteful number, since it uses less digits than its factorization.
649355088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011 (or 10005 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 48.
The square root of 649355088 is about 25482.4466643217. The cubic root of 649355088 is about 865.9525243900.
The spelling of 649355088 in words is "six hundred forty-nine million, three hundred fifty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •