Base | Representation |
---|---|
bin | 10010011000011110001… |
… | …01100101110000100111 |
3 | 2020101022012212220112210 |
4 | 21030033011211300213 |
5 | 40322021002104020 |
6 | 1202054213214503 |
7 | 63426652414314 |
oct | 11141705456047 |
9 | 2211265786483 |
10 | 631613316135 |
11 | 22395828394a |
12 | a24b2031433 |
13 | 4773a33b429 |
14 | 227daa8bd0b |
15 | 1166a4263e0 |
hex | 930f165c27 |
631613316135 has 16 divisors (see below), whose sum is σ = 1010663450496. Its totient is φ = 336833053728.
The previous prime is 631613316133. The next prime is 631613316157. The reversal of 631613316135 is 531613316136.
It is not a de Polignac number, because 631613316135 - 21 = 631613316133 is a prime.
It is a super-2 number, since 2×6316133161352 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 631613316093 and 631613316102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (631613316133) 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, 1519969 + ... + 1890378.
It is an arithmetic number, because the mean of its divisors is an integer number (63166465656).
Almost surely, 2631613316135 is an apocalyptic number.
631613316135 is a deficient number, since it is larger than the sum of its proper divisors (379050134361).
631613316135 is a wasteful number, since it uses less digits than its factorization.
631613316135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3422702.
The product of its digits is 87480, while the sum is 39.
Subtracting from 631613316135 its reverse (531613316136), we obtain a palindrome (99999999999).
The spelling of 631613316135 in words is "six hundred thirty-one billion, six hundred thirteen million, three hundred sixteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •