Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1101001000110001001 |
3 | 110112011022111121022011 |
4 | 1322000303221012021 |
5 | 4121302032241301 |
6 | 140103555455521 |
7 | 12315356652655 |
oct | 1720063510611 |
9 | 415138447264 |
10 | 131010040201 |
11 | 506198302a7 |
12 | 21482bb75a1 |
13 | c47b218961 |
14 | 64ab6aba65 |
15 | 361b879a51 |
hex | 1e80ce9189 |
131010040201 has 4 divisors (see below), whose sum is σ = 138716513172. Its totient is φ = 123303567232.
The previous prime is 131010040171. The next prime is 131010040219. The reversal of 131010040201 is 102040010131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97821945225 + 33188094976 = 312765^2 + 182176^2 .
It is a cyclic number.
It is not a de Polignac number, because 131010040201 - 215 = 131010007433 is a prime.
It is a super-2 number, since 2×1310100402012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131010040501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3853236460 + ... + 3853236493.
It is an arithmetic number, because the mean of its divisors is an integer number (34679128293).
Almost surely, 2131010040201 is an apocalyptic number.
It is an amenable number.
131010040201 is a deficient number, since it is larger than the sum of its proper divisors (7706472971).
131010040201 is an equidigital number, since it uses as much as digits as its factorization.
131010040201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7706472970.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 131010040201 its reverse (102040010131), we get a palindrome (233050050332).
The spelling of 131010040201 in words is "one hundred thirty-one billion, ten million, forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •