Base | Representation |
---|---|
bin | 11101110010010110000100… |
… | …011110111111001110011111 |
3 | 122011211202200201111100000100 |
4 | 131302112010132333032133 |
5 | 114132323141133223403 |
6 | 1142341542350032143 |
7 | 36410440651631625 |
oct | 3562260436771637 |
9 | 564752621440010 |
10 | 131003020211103 |
11 | 38818083738457 |
12 | 1283931a4a8653 |
13 | 58136bb490791 |
14 | 244c81978d515 |
15 | 1022a510472a3 |
hex | 7725847bf39f |
131003020211103 has 6 divisors (see below), whose sum is σ = 189226584749384. Its totient is φ = 87335346807396.
The previous prime is 131003020211099. The next prime is 131003020211111. The reversal of 131003020211103 is 301112020300131.
It is not a de Polignac number, because 131003020211103 - 22 = 131003020211099 is a prime.
It is a super-2 number, since 2×1310030202111032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131003020219103) 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 5 ways as a sum of consecutive naturals, for example, 7277945567275 + ... + 7277945567292.
Almost surely, 2131003020211103 is an apocalyptic number.
131003020211103 is a deficient number, since it is larger than the sum of its proper divisors (58223564538281).
131003020211103 is a wasteful number, since it uses less digits than its factorization.
131003020211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14555891134573 (or 14555891134570 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 131003020211103 its reverse (301112020300131), we get a palindrome (432115040511234).
The spelling of 131003020211103 in words is "one hundred thirty-one trillion, three billion, twenty million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •