Base | Representation |
---|---|
bin | 11101111010001010010010… |
… | …110010100011001111110001 |
3 | 122020202010001220110011211110 |
4 | 131322022102302203033301 |
5 | 114220123142032214101 |
6 | 1143432411345103533 |
7 | 36464314034266155 |
oct | 3572122262431761 |
9 | 566663056404743 |
10 | 131540131132401 |
11 | 38a04946864342 |
12 | 12905437927ba9 |
13 | 5852247c75084 |
14 | 246a80d5ad065 |
15 | 10319d9bcdcd6 |
hex | 77a292ca33f1 |
131540131132401 has 8 divisors (see below), whose sum is σ = 175415079635104. Its totient is φ = 87679301692320.
The previous prime is 131540131132331. The next prime is 131540131132433. The reversal of 131540131132401 is 104231131045131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131540131132401 - 227 = 131539996914673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131540131132481) 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, 3529743916 + ... + 3529781181.
It is an arithmetic number, because the mean of its divisors is an integer number (21926884954388).
Almost surely, 2131540131132401 is an apocalyptic number.
It is an amenable number.
131540131132401 is a deficient number, since it is larger than the sum of its proper divisors (43874948502703).
131540131132401 is an equidigital number, since it uses as much as digits as its factorization.
131540131132401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7059531311.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 131540131132401 its reverse (104231131045131), we get a palindrome (235771262177532).
The spelling of 131540131132401 in words is "one hundred thirty-one trillion, five hundred forty billion, one hundred thirty-one million, one hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •