Base | Representation |
---|---|
bin | 11101111000011100101011… |
… | …111000000010010110101101 |
3 | 122020022212021211120112100202 |
4 | 131320130223320002112231 |
5 | 114211211124220302201 |
6 | 1143302345144203245 |
7 | 36452646405465221 |
oct | 3570345370022655 |
9 | 566285254515322 |
10 | 131422440400301 |
11 | 38969a42480396 |
12 | 128a6671469525 |
13 | 584411032941b |
14 | 2464c46c28781 |
15 | 102d8ec82ac6b |
hex | 77872be025ad |
131422440400301 has 8 divisors (see below), whose sum is σ = 139153355947584. Its totient is φ = 123691545270720.
The previous prime is 131422440400259. The next prime is 131422440400417. The reversal of 131422440400301 is 103004044224131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131422440400301 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131422440409301) 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, 9310736 + ... + 18695846.
It is an arithmetic number, because the mean of its divisors is an integer number (17394169493448).
Almost surely, 2131422440400301 is an apocalyptic number.
It is an amenable number.
131422440400301 is a deficient number, since it is larger than the sum of its proper divisors (7730915547283).
131422440400301 is an equidigital number, since it uses as much as digits as its factorization.
131422440400301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10208851.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 131422440400301 its reverse (103004044224131), we get a palindrome (234426484624432).
The spelling of 131422440400301 in words is "one hundred thirty-one trillion, four hundred twenty-two billion, four hundred forty million, four hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •