Base | Representation |
---|---|
bin | 111010110100101000… |
… | …111100011000111101 |
3 | 20001000202000021200221 |
4 | 322310220330120331 |
5 | 2013323001033031 |
6 | 45003153421341 |
7 | 4364111423251 |
oct | 726450743075 |
9 | 201022007627 |
10 | 63160174141 |
11 | 248712a9729 |
12 | 102a826a851 |
13 | 5c5739350c |
14 | 30b2472261 |
15 | 1999dd5a11 |
hex | eb4a3c63d |
63160174141 has 4 divisors (see below), whose sum is σ = 63160835452. Its totient is φ = 63159512832.
The previous prime is 63160174123. The next prime is 63160174199. The reversal of 63160174141 is 14147106136.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 16594850041 + 46565324100 = 128821^2 + 215790^2 .
It is a cyclic number.
It is not a de Polignac number, because 63160174141 - 25 = 63160174109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63160174097 and 63160174106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63160184141) 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, 156990 + ... + 388543.
It is an arithmetic number, because the mean of its divisors is an integer number (15790208863).
Almost surely, 263160174141 is an apocalyptic number.
It is an amenable number.
63160174141 is a deficient number, since it is larger than the sum of its proper divisors (661311).
63160174141 is a wasteful number, since it uses less digits than its factorization.
63160174141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661310.
The product of its (nonzero) digits is 12096, while the sum is 34.
The spelling of 63160174141 in words is "sixty-three billion, one hundred sixty million, one hundred seventy-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.095 sec. • engine limits •