Base | Representation |
---|---|
bin | 11101111000001010110111… |
… | …000010101110110100011011 |
3 | 122020021000212221021210110221 |
4 | 131320022313002232310123 |
5 | 114210402424400303121 |
6 | 1143245502015420511 |
7 | 36451401165252244 |
oct | 3570126702566433 |
9 | 566230787253427 |
10 | 131403300400411 |
11 | 38961910443166 |
12 | 128a2a0b524737 |
13 | 584237cb816c0 |
14 | 2463d4cc49ccb |
15 | 102d17c339b41 |
hex | 7782b70aed1b |
131403300400411 has 12 divisors (see below), whose sum is σ = 149351204849952. Its totient is φ = 114911388200304.
The previous prime is 131403300400409. The next prime is 131403300400417. The reversal of 131403300400411 is 114004003304131.
It is a happy number.
It is not a de Polignac number, because 131403300400411 - 21 = 131403300400409 is a prime.
It is a super-2 number, since 2×1314033004004112 (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 (131403300400417) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13999920771 + ... + 13999930156.
It is an arithmetic number, because the mean of its divisors is an integer number (12445933737496).
Almost surely, 2131403300400411 is an apocalyptic number.
131403300400411 is a deficient number, since it is larger than the sum of its proper divisors (17947904449541).
131403300400411 is a wasteful number, since it uses less digits than its factorization.
131403300400411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27999850978 (or 27999850959 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 131403300400411 its reverse (114004003304131), we get a palindrome (245407303704542).
The spelling of 131403300400411 in words is "one hundred thirty-one trillion, four hundred three billion, three hundred million, four hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •