Base | Representation |
---|---|
bin | 100110010010110010011… |
… | …011111001010101001100 |
3 | 100022120101201011210201221 |
4 | 212102302123321111030 |
5 | 321103314443023231 |
6 | 5332522314013124 |
7 | 361056234616216 |
oct | 46226233712514 |
9 | 10276351153657 |
10 | 2631513642316 |
11 | 925022936279 |
12 | 3660087171a4 |
13 | 1611c60445c0 |
14 | 9151a1d35b6 |
15 | 486b97b5d11 |
hex | 264b26f954c |
2631513642316 has 12 divisors (see below), whose sum is σ = 4959391095232. Its totient is φ = 1214544757968.
The previous prime is 2631513642313. The next prime is 2631513642337. The reversal of 2631513642316 is 6132463151362.
2631513642316 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (43) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (2631513642313) 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, 25303015740 + ... + 25303015843.
Almost surely, 22631513642316 is an apocalyptic number.
2631513642316 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
2631513642316 is a deficient number, since it is larger than the sum of its proper divisors (2327877452916).
2631513642316 is a wasteful number, since it uses less digits than its factorization.
2631513642316 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50606031600 (or 50606031598 counting only the distinct ones).
The product of its digits is 466560, while the sum is 43.
Adding to 2631513642316 its reverse (6132463151362), we get a palindrome (8763976793678).
The spelling of 2631513642316 in words is "two trillion, six hundred thirty-one billion, five hundred thirteen million, six hundred forty-two thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •