Base | Representation |
---|---|
bin | 11101111000001010110010… |
… | …110110010000001000001001 |
3 | 122020021000201000212002211221 |
4 | 131320022302312100020021 |
5 | 114210402303341120410 |
6 | 1143245451023122041 |
7 | 36451366352112661 |
oct | 3570126266201011 |
9 | 566230630762757 |
10 | 131403230020105 |
11 | 3896188474241a |
12 | 128a29aba43321 |
13 | 584236b40ba54 |
14 | 2463d437691a1 |
15 | 102d1760864da |
hex | 7782b2d90209 |
131403230020105 has 16 divisors (see below), whose sum is σ = 163996040349504. Its totient is φ = 100994628934080.
The previous prime is 131403230020087. The next prime is 131403230020133. The reversal of 131403230020105 is 501020032304131.
It is a happy number.
It is not a de Polignac number, because 131403230020105 - 237 = 131265791066633 is a prime.
It is a super-2 number, since 2×1314032300201052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131403230020105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5009641099 + ... + 5009667328.
It is an arithmetic number, because the mean of its divisors is an integer number (10249752521844).
Almost surely, 2131403230020105 is an apocalyptic number.
It is an amenable number.
131403230020105 is a deficient number, since it is larger than the sum of its proper divisors (32592810329399).
131403230020105 is a wasteful number, since it uses less digits than its factorization.
131403230020105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10019308536.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 131403230020105 its reverse (501020032304131), we get a palindrome (632423262324236).
The spelling of 131403230020105 in words is "one hundred thirty-one trillion, four hundred three billion, two hundred thirty million, twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •