Base | Representation |
---|---|
bin | 11101111000001010100111… |
… | …101101001101100101010011 |
3 | 122020021000020000010122001112 |
4 | 131320022213231031211103 |
5 | 114210401413013213021 |
6 | 1143245420304523535 |
7 | 36451361622246233 |
oct | 3570124755154523 |
9 | 566230200118045 |
10 | 131403043101011 |
11 | 38961799184330 |
12 | 128a29593205ab |
13 | 584233b784736 |
14 | 2463d269cdcc3 |
15 | 102d164962d5b |
hex | 7782a7b4d953 |
131403043101011 has 8 divisors (see below), whose sum is σ = 143351425473984. Its totient is φ = 119455102591720.
The previous prime is 131403043100993. The next prime is 131403043101013. The reversal of 131403043101011 is 110101340304131.
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 131403043101011 - 234 = 131385863231827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131403043101013) 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, 109843961 + ... + 111033786.
It is an arithmetic number, because the mean of its divisors is an integer number (17918928184248).
Almost surely, 2131403043101011 is an apocalyptic number.
131403043101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131403043101011 is a deficient number, since it is larger than the sum of its proper divisors (11948382372973).
131403043101011 is a wasteful number, since it uses less digits than its factorization.
131403043101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220931841.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 131403043101011 its reverse (110101340304131), we get a palindrome (241504383405142).
The spelling of 131403043101011 in words is "one hundred thirty-one trillion, four hundred three billion, forty-three million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •