Base | Representation |
---|---|
bin | 10010011110000111110… |
… | …00011010000000110010 |
3 | 2020200010121102110022020 |
4 | 21033003320122000302 |
5 | 40344224003124432 |
6 | 1203315205452310 |
7 | 63565063356525 |
oct | 11170370320062 |
9 | 2220117373266 |
10 | 634646536242 |
11 | 225174474024 |
12 | a2bb9a11096 |
13 | 47b01884524 |
14 | 22a07860bbc |
15 | 1179687d22c |
hex | 93c3e1a032 |
634646536242 has 8 divisors (see below), whose sum is σ = 1269293072496. Its totient is φ = 211548845412.
The previous prime is 634646536229. The next prime is 634646536243. The reversal of 634646536242 is 242635646436.
It is a sphenic number, since it is the product of 3 distinct primes.
634646536242 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (634646536243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52887211348 + ... + 52887211359.
It is an arithmetic number, because the mean of its divisors is an integer number (158661634062).
Almost surely, 2634646536242 is an apocalyptic number.
634646536242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
634646536242 is a wasteful number, since it uses less digits than its factorization.
634646536242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105774422712.
The product of its digits is 14929920, while the sum is 51.
The spelling of 634646536242 in words is "six hundred thirty-four billion, six hundred forty-six million, five hundred thirty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •