Base | Representation |
---|---|
bin | 11101110100000011001010… |
… | …001010010001001111110001 |
3 | 122012020222000221001212120012 |
4 | 131310003022022101033301 |
5 | 114141233033221131001 |
6 | 1142511433350424305 |
7 | 36422055426524513 |
oct | 3564031212211761 |
9 | 565228027055505 |
10 | 131120153302001 |
11 | 38862821275306 |
12 | 12857b6a062095 |
13 | 5821767721c16 |
14 | 245436c055bb3 |
15 | 1025b094982bb |
hex | 7740ca2913f1 |
131120153302001 has 4 divisors (see below), whose sum is σ = 134318205821604. Its totient is φ = 127922100782400.
The previous prime is 131120153301979. The next prime is 131120153302051. The reversal of 131120153302001 is 100203351021131.
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 65107534517776 + 66012618784225 = 8068924^2 + 8124815^2 .
It is a cyclic number.
It is not a de Polignac number, because 131120153302001 - 210 = 131120153300977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131120153302051) 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, 1599026259740 + ... + 1599026259821.
It is an arithmetic number, because the mean of its divisors is an integer number (33579551455401).
Almost surely, 2131120153302001 is an apocalyptic number.
It is an amenable number.
131120153302001 is a deficient number, since it is larger than the sum of its proper divisors (3198052519603).
131120153302001 is an equidigital number, since it uses as much as digits as its factorization.
131120153302001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3198052519602.
The product of its (nonzero) digits is 540, while the sum is 23.
The spelling of 131120153302001 in words is "one hundred thirty-one trillion, one hundred twenty billion, one hundred fifty-three million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •