Base | Representation |
---|---|
bin | 10010111010111101100… |
… | …01101101110110000000 |
3 | 2022011002200120200020100 |
4 | 21131132301231312000 |
5 | 41122431304342312 |
6 | 1214355441242400 |
7 | 64653555056046 |
oct | 11353661556600 |
9 | 2264080520210 |
10 | 650130152832 |
11 | 23079a582376 |
12 | a5bbb333400 |
13 | 493cb66a434 |
14 | 23675db4396 |
15 | 11da0d715dc |
hex | 975ec6dd80 |
650130152832 has 192 divisors, whose sum is σ = 1952973640800. Its totient is φ = 207201189888.
The previous prime is 650130152827. The next prime is 650130152869. The reversal of 650130152832 is 238251031056.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100496094 + ... + 100502562.
Almost surely, 2650130152832 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 650130152832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (976486820400).
650130152832 is an abundant number, since it is smaller than the sum of its proper divisors (1302843487968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
650130152832 is a wasteful number, since it uses less digits than its factorization.
650130152832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10305 (or 10290 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 650130152832 its reverse (238251031056), we get a palindrome (888381183888).
The spelling of 650130152832 in words is "six hundred fifty billion, one hundred thirty million, one hundred fifty-two thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •