Base | Representation |
---|---|
bin | 1001101010110101110100… |
… | …0011101111110111111011 |
3 | 1101122101000212001222101212 |
4 | 2122231131003233313323 |
5 | 2343142011430234321 |
6 | 34340031515033335 |
7 | 2145052043113040 |
oct | 232553503576773 |
9 | 41571025058355 |
10 | 10631605321211 |
11 | 3429925047196 |
12 | 123858713b84b |
13 | 5c172c927914 |
14 | 28a802ad91c7 |
15 | 1368447da55b |
hex | 9ab5d0efdfb |
10631605321211 has 16 divisors (see below), whose sum is σ = 12433139136000. Its totient is φ = 8900760411648.
The previous prime is 10631605321201. The next prime is 10631605321217. The reversal of 10631605321211 is 11212350613601.
It is not a de Polignac number, because 10631605321211 - 26 = 10631605321147 is a prime.
It is a super-2 number, since 2×106316053212112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10631605321217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28072490 + ... + 28448688.
It is an arithmetic number, because the mean of its divisors is an integer number (777071196000).
Almost surely, 210631605321211 is an apocalyptic number.
10631605321211 is a deficient number, since it is larger than the sum of its proper divisors (1801533814789).
10631605321211 is an equidigital number, since it uses as much as digits as its factorization.
10631605321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470138.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 10631605321211 its reverse (11212350613601), we get a palindrome (21843955934812).
The spelling of 10631605321211 in words is "ten trillion, six hundred thirty-one billion, six hundred five million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •