Base | Representation |
---|---|
bin | 11101111000010011111111… |
… | …110100101110101101010101 |
3 | 122020021222012200102021120021 |
4 | 131320103333310232231111 |
5 | 114211033023004320201 |
6 | 1143254203331305141 |
7 | 36452166256345342 |
oct | 3570237764565525 |
9 | 566258180367507 |
10 | 131413111401301 |
11 | 38965a954a9364 |
12 | 128a48a914b1b1 |
13 | 5843284666b82 |
14 | 24645ddc517c9 |
15 | 102d553812ea1 |
hex | 7784ffd2eb55 |
131413111401301 has 8 divisors (see below), whose sum is σ = 139005173229120. Its totient is φ = 123977586930912.
The previous prime is 131413111401277. The next prime is 131413111401329. The reversal of 131413111401301 is 103104111314131.
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 131413111401301 - 29 = 131413111400789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131413111401371) 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, 39134337631 + ... + 39134340988.
It is an arithmetic number, because the mean of its divisors is an integer number (17375646653640).
Almost surely, 2131413111401301 is an apocalyptic number.
It is an amenable number.
131413111401301 is a deficient number, since it is larger than the sum of its proper divisors (7592061827819).
131413111401301 is an equidigital number, since it uses as much as digits as its factorization.
131413111401301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78268678715.
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 131413111401301 its reverse (103104111314131), we get a palindrome (234517222715432).
The spelling of 131413111401301 in words is "one hundred thirty-one trillion, four hundred thirteen billion, one hundred eleven million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •