Base | Representation |
---|---|
bin | 11101111000001010100111… |
… | …000000100101001111000101 |
3 | 122020021000012012010020020002 |
4 | 131320022213000211033011 |
5 | 114210401402014321123 |
6 | 1143245415210051045 |
7 | 36451361420640512 |
oct | 3570124700451705 |
9 | 566230165106202 |
10 | 131403031401413 |
11 | 38961792613242 |
12 | 128a2955419a85 |
13 | 58423392193b5 |
14 | 2463d25226309 |
15 | 102d163901528 |
hex | 7782a70253c5 |
131403031401413 has 16 divisors (see below), whose sum is σ = 139284624384000. Its totient is φ = 123620904599472.
The previous prime is 131403031401371. The next prime is 131403031401457. The reversal of 131403031401413 is 314104130304131.
It is a cyclic number.
It is not a de Polignac number, because 131403031401413 - 212 = 131403031397317 is a prime.
It is a super-2 number, since 2×1314030314014132 (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 (131403031409413) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38672045 + ... + 41932482.
It is an arithmetic number, because the mean of its divisors is an integer number (8705289024000).
Almost surely, 2131403031401413 is an apocalyptic number.
It is an amenable number.
131403031401413 is a deficient number, since it is larger than the sum of its proper divisors (7881592982587).
131403031401413 is a wasteful number, since it uses less digits than its factorization.
131403031401413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80605144.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 131403031401413 its reverse (314104130304131), we get a palindrome (445507161705544).
The spelling of 131403031401413 in words is "one hundred thirty-one trillion, four hundred three billion, thirty-one million, four hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •