Base | Representation |
---|---|
bin | 11101111000001010110111… |
… | …000010011011100000110011 |
3 | 122020021000212221010210000001 |
4 | 131320022313002123200303 |
5 | 114210402424340240311 |
6 | 1143245502014010431 |
7 | 36451401164502553 |
oct | 3570126702334063 |
9 | 566230787123001 |
10 | 131403300321331 |
11 | 38961910399805 |
12 | 128a2a0b4a6a17 |
13 | 584237cb546cc |
14 | 2463d4cc29163 |
15 | 102d17c3214c1 |
hex | 7782b709b833 |
131403300321331 has 2 divisors, whose sum is σ = 131403300321332. Its totient is φ = 131403300321330.
The previous prime is 131403300321299. The next prime is 131403300321341. The reversal of 131403300321331 is 133123003304131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131403300321331 - 25 = 131403300321299 is a prime.
It is a super-2 number, since 2×1314033003213312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131403300321331.
It is not a weakly prime, because it can be changed into another prime (131403300321341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701650160665 + 65701650160666.
It is an arithmetic number, because the mean of its divisors is an integer number (65701650160666).
Almost surely, 2131403300321331 is an apocalyptic number.
131403300321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
131403300321331 is an equidigital number, since it uses as much as digits as its factorization.
131403300321331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 131403300321331 its reverse (133123003304131), we get a palindrome (264526303625462).
The spelling of 131403300321331 in words is "one hundred thirty-one trillion, four hundred three billion, three hundred million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •