Base | Representation |
---|---|
bin | 11101110111010001111101… |
… | …001100011000100011110001 |
3 | 122020001012011202200121101110 |
4 | 131313101331030120203301 |
5 | 114203402311234410001 |
6 | 1143201435052423533 |
7 | 36444106110124002 |
oct | 3567217514304361 |
9 | 566035152617343 |
10 | 131342200310001 |
11 | 38938a06a9997a |
12 | 12892bb9177ba9 |
13 | 5839693541655 |
14 | 2460dd42331a9 |
15 | 102b7a32343d6 |
hex | 77747d3188f1 |
131342200310001 has 8 divisors (see below), whose sum is σ = 175126633273440. Its totient is φ = 87559617109952.
The previous prime is 131342200309987. The next prime is 131342200310051. The reversal of 131342200310001 is 100013002243131.
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 131342200310001 - 229 = 131341663439089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131342200310001.
It is not an unprimeable number, because it can be changed into a prime (131342200310051) 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, 462275160 + ... + 462559193.
It is an arithmetic number, because the mean of its divisors is an integer number (21890829159180).
Almost surely, 2131342200310001 is an apocalyptic number.
It is an amenable number.
131342200310001 is a deficient number, since it is larger than the sum of its proper divisors (43784432963439).
131342200310001 is an equidigital number, since it uses as much as digits as its factorization.
131342200310001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 924881695.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131342200310001 its reverse (100013002243131), we get a palindrome (231355202553132).
The spelling of 131342200310001 in words is "one hundred thirty-one trillion, three hundred forty-two billion, two hundred million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •