Base | Representation |
---|---|
bin | 1001000001000111001001100… |
… | …0111100001100000110010001 |
3 | 10002012201112022200122000022120 |
4 | 2100101302120330030012101 |
5 | 1131132310014230213230 |
6 | 10125320043222524453 |
7 | 250441035235003251 |
oct | 22021623074140621 |
9 | 3065645280560276 |
10 | 634541034226065 |
11 | 17420338340848a |
12 | 5b202378596729 |
13 | 2130ac692a64b5 |
14 | b299d42845961 |
15 | 4d55d0625e310 |
hex | 2411c98f0c191 |
634541034226065 has 16 divisors (see below), whose sum is σ = 1017142301086656. Its totient is φ = 337796336145600.
The previous prime is 634541034226063. The next prime is 634541034226079. The reversal of 634541034226065 is 560622430145436.
It is not a de Polignac number, because 634541034226065 - 21 = 634541034226063 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 634541034225999 and 634541034226017.
It is not an unprimeable number, because it can be changed into a prime (634541034226063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39096790051 + ... + 39096806280.
It is an arithmetic number, because the mean of its divisors is an integer number (63571393817916).
Almost surely, 2634541034226065 is an apocalyptic number.
It is an amenable number.
634541034226065 is a deficient number, since it is larger than the sum of its proper divisors (382601266860591).
634541034226065 is a wasteful number, since it uses less digits than its factorization.
634541034226065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78193596880.
The product of its (nonzero) digits is 12441600, while the sum is 51.
The spelling of 634541034226065 in words is "six hundred thirty-four trillion, five hundred forty-one billion, thirty-four million, two hundred twenty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •