Base | Representation |
---|---|
bin | 11101110010101010110111… |
… | …100000001100110100001001 |
3 | 122011220220022222211010012202 |
4 | 131302222313200030310021 |
5 | 114133204404324102101 |
6 | 1142400114300245545 |
7 | 36412161225345431 |
oct | 3562526740146411 |
9 | 564826288733182 |
10 | 131025351003401 |
11 | 388265a28aa1a8 |
12 | 12841710b408b5 |
13 | 5815839a0204a |
14 | 244d93743b2c1 |
15 | 102340b71836b |
hex | 772ab780cd09 |
131025351003401 has 4 divisors (see below), whose sum is σ = 131027745220992. Its totient is φ = 131022956785812.
The previous prime is 131025351003397. The next prime is 131025351003409. The reversal of 131025351003401 is 104300153520131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131025351003401 - 22 = 131025351003397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131025351003409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1197026705 + ... + 1197136158.
It is an arithmetic number, because the mean of its divisors is an integer number (32756936305248).
Almost surely, 2131025351003401 is an apocalyptic number.
It is an amenable number.
131025351003401 is a deficient number, since it is larger than the sum of its proper divisors (2394217591).
131025351003401 is an equidigital number, since it uses as much as digits as its factorization.
131025351003401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2394217590.
The product of its (nonzero) digits is 5400, while the sum is 29.
The spelling of 131025351003401 in words is "one hundred thirty-one trillion, twenty-five billion, three hundred fifty-one million, three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •