Base | Representation |
---|---|
bin | 111010101111110111… |
… | …101110000010010111 |
3 | 20000211011110012220020 |
4 | 322233313232002113 |
5 | 2013142010131211 |
6 | 44551214440223 |
7 | 4362120345120 |
oct | 725767560227 |
9 | 200734405806 |
10 | 63080161431 |
11 | 24830119a21 |
12 | 10285503073 |
13 | 5c4392a411 |
14 | 30a59a5047 |
15 | 1992d7d306 |
hex | eafdee097 |
63080161431 has 8 divisors (see below), whose sum is σ = 96122150784. Its totient is φ = 36045806520.
The previous prime is 63080161423. The next prime is 63080161477. The reversal of 63080161431 is 13416108036.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 63080161431 - 23 = 63080161423 is a prime.
It is a super-2 number, since 2×630801614312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 63080161392 and 63080161401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63080161931) 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 7 ways as a sum of consecutive naturals, for example, 1501908585 + ... + 1501908626.
It is an arithmetic number, because the mean of its divisors is an integer number (12015268848).
Almost surely, 263080161431 is an apocalyptic number.
63080161431 is a deficient number, since it is larger than the sum of its proper divisors (33041989353).
63080161431 is a wasteful number, since it uses less digits than its factorization.
63080161431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3003817221.
The product of its (nonzero) digits is 10368, while the sum is 33.
Adding to 63080161431 its reverse (13416108036), we get a palindrome (76496269467).
The spelling of 63080161431 in words is "sixty-three billion, eighty million, one hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •