Base | Representation |
---|---|
bin | 111011000100111011… |
… | …000100111011000101 |
3 | 20001201210001201120001 |
4 | 323010323010323011 |
5 | 2014402420110031 |
6 | 45050233041301 |
7 | 4403636455531 |
oct | 730473047305 |
9 | 201653051501 |
10 | 63433363141 |
11 | 249a1530665 |
12 | 10363856231 |
13 | 5c9bb64a05 |
14 | 30da866bc1 |
15 | 19b3d9a861 |
hex | ec4ec4ec5 |
63433363141 has 8 divisors (see below), whose sum is σ = 63570510080. Its totient is φ = 63296363952.
The previous prime is 63433363127. The next prime is 63433363207. The reversal of 63433363141 is 14136333436.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 63433363141 - 223 = 63424974533 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 63433363141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63433363111) 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 7 ways as a sum of consecutive naturals, for example, 845236 + ... + 917218.
It is an arithmetic number, because the mean of its divisors is an integer number (7946313760).
Almost surely, 263433363141 is an apocalyptic number.
It is an amenable number.
63433363141 is a deficient number, since it is larger than the sum of its proper divisors (137146939).
63433363141 is a wasteful number, since it uses less digits than its factorization.
63433363141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73875.
The product of its digits is 139968, while the sum is 37.
Adding to 63433363141 its reverse (14136333436), we get a palindrome (77569696577).
The spelling of 63433363141 in words is "sixty-three billion, four hundred thirty-three million, three hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •