Base | Representation |
---|---|
bin | 111010110011000111… |
… | …111001111101110001 |
3 | 20000221222010220110111 |
4 | 322303013321331301 |
5 | 2013244443024431 |
6 | 45000444301321 |
7 | 4363352255263 |
oct | 726307717561 |
9 | 200858126414 |
10 | 63134736241 |
11 | 24858a04875 |
12 | 1029b841841 |
13 | 5c52027bc5 |
14 | 30acd2db33 |
15 | 1997a5d7b1 |
hex | eb31f9f71 |
63134736241 has 4 divisors (see below), whose sum is σ = 63170266852. Its totient is φ = 63099205632.
The previous prime is 63134736239. The next prime is 63134736253. The reversal of 63134736241 is 14263743136.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40362417216 + 22772319025 = 200904^2 + 150905^2 .
It is a cyclic number.
It is not a de Polignac number, because 63134736241 - 21 = 63134736239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63134736194 and 63134736203.
It is not an unprimeable number, because it can be changed into a prime (63134736641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17762640 + ... + 17766193.
It is an arithmetic number, because the mean of its divisors is an integer number (15792566713).
Almost surely, 263134736241 is an apocalyptic number.
It is an amenable number.
63134736241 is a deficient number, since it is larger than the sum of its proper divisors (35530611).
63134736241 is a wasteful number, since it uses less digits than its factorization.
63134736241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35530610.
The product of its digits is 217728, while the sum is 40.
The spelling of 63134736241 in words is "sixty-three billion, one hundred thirty-four million, seven hundred thirty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •