Base | Representation |
---|---|
bin | 11101110110111111001111… |
… | …110010001000010001100011 |
3 | 122012222021022201022000000201 |
4 | 131312333033302020101203 |
5 | 114203040140420200003 |
6 | 1143144313415130031 |
7 | 36442465222504435 |
oct | 3566771762102143 |
9 | 565867281260021 |
10 | 131322111100003 |
11 | 3893043817908a |
12 | 1288b131373917 |
13 | 5837811530545 |
14 | 246004a168655 |
15 | 102aec9745b1d |
hex | 776fcfc88463 |
131322111100003 has 8 divisors (see below), whose sum is σ = 134911476697536. Its totient is φ = 127757080185000.
The previous prime is 131322111099997. The next prime is 131322111100013. The reversal of 131322111100003 is 300001111223131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131322111100003 is a prime.
It is a super-2 number, since 2×1313221111000032 (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 (131322111100013) 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, 6083659693 + ... + 6083681278.
It is an arithmetic number, because the mean of its divisors is an integer number (16863934587192).
Almost surely, 2131322111100003 is an apocalyptic number.
131322111100003 is a deficient number, since it is larger than the sum of its proper divisors (3589365597533).
131322111100003 is a wasteful number, since it uses less digits than its factorization.
131322111100003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12167341265.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131322111100003 its reverse (300001111223131), we get a palindrome (431323222323134).
The spelling of 131322111100003 in words is "one hundred thirty-one trillion, three hundred twenty-two billion, one hundred eleven million, one hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •