Base | Representation |
---|---|
bin | 1001000001011110100001010… |
… | …0101110111000010010111111 |
3 | 10002021010220200112100121121212 |
4 | 2100113220110232320102333 |
5 | 1131210344312011223044 |
6 | 10130224324422515035 |
7 | 250512041060606324 |
oct | 22027502456702277 |
9 | 3067126615317555 |
10 | 634942543070399 |
11 | 174348690710973 |
12 | 5b268150b95a7b |
13 | 21339a953b2625 |
14 | b2b1551170b4b |
15 | 4d614a534ca9e |
hex | 2417a14bb84bf |
634942543070399 has 4 divisors (see below), whose sum is σ = 634942779655080. Its totient is φ = 634942306485720.
The previous prime is 634942543070389. The next prime is 634942543070477. The reversal of 634942543070399 is 993070345249436.
634942543070399 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 634942543070399 - 216 = 634942543004863 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (634942543070389) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114219929 + ... + 119649810.
It is an arithmetic number, because the mean of its divisors is an integer number (158735694913770).
Almost surely, 2634942543070399 is an apocalyptic number.
634942543070399 is a deficient number, since it is larger than the sum of its proper divisors (236584681).
634942543070399 is a wasteful number, since it uses less digits than its factorization.
634942543070399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236584680.
The product of its (nonzero) digits is 529079040, while the sum is 68.
The spelling of 634942543070399 in words is "six hundred thirty-four trillion, nine hundred forty-two billion, five hundred forty-three million, seventy thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.685 sec. • engine limits •