Base | Representation |
---|---|
bin | 10010011110100110010… |
… | …10011110001101000110 |
3 | 2020200210110212121202110 |
4 | 21033103022132031012 |
5 | 40400240122231441 |
6 | 1203400445121450 |
7 | 63604325602104 |
oct | 11172312361506 |
9 | 2220713777673 |
10 | 634902930246 |
11 | 2252961746a2 |
12 | a306b859286 |
13 | 47b42a25360 |
14 | 22a2d922c74 |
15 | 117ae126b16 |
hex | 93d329e346 |
634902930246 has 128 divisors (see below), whose sum is σ = 1403991138816. Its totient is φ = 190219392000.
The previous prime is 634902930227. The next prime is 634902930253. The reversal of 634902930246 is 642039209436.
634902930246 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 634902930195 and 634902930204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 179704696 + ... + 179708228.
It is an arithmetic number, because the mean of its divisors is an integer number (10968680772).
Almost surely, 2634902930246 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 634902930246, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (701995569408).
634902930246 is an abundant number, since it is smaller than the sum of its proper divisors (769088208570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
634902930246 is a wasteful number, since it uses less digits than its factorization.
634902930246 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4006.
The product of its (nonzero) digits is 1679616, while the sum is 48.
The spelling of 634902930246 in words is "six hundred thirty-four billion, nine hundred two million, nine hundred thirty thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •