Base | Representation |
---|---|
bin | 11101110010010110000011… |
… | …111101000111010010000011 |
3 | 122011211202200002210012002011 |
4 | 131302112003331013102003 |
5 | 114132323131400044303 |
6 | 1142341541431433351 |
7 | 36410440513305664 |
oct | 3562260375072203 |
9 | 564752602705064 |
10 | 131003011331203 |
11 | 388180797228a0 |
12 | 12839317525857 |
13 | 58136b96a19bb |
14 | 244c81851b36b |
15 | 1022a5039116d |
hex | 772583f47483 |
131003011331203 has 8 divisors (see below), whose sum is σ = 142913847924720. Its totient is φ = 119092420058880.
The previous prime is 131003011331189. The next prime is 131003011331239. The reversal of 131003011331203 is 302133110300131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131003011331203 - 213 = 131003011323011 is a prime.
It is a super-2 number, since 2×1310030113312032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131003011331263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60212850 + ... + 62350567.
It is an arithmetic number, because the mean of its divisors is an integer number (17864230990590).
Almost surely, 2131003011331203 is an apocalyptic number.
131003011331203 is a deficient number, since it is larger than the sum of its proper divisors (11910836593517).
131003011331203 is a wasteful number, since it uses less digits than its factorization.
131003011331203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122660597.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 131003011331203 its reverse (302133110300131), we get a palindrome (433136121631334).
The spelling of 131003011331203 in words is "one hundred thirty-one trillion, three billion, eleven million, three hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •