Base | Representation |
---|---|
bin | 111101001100010111… |
… | …0011100010101100001 |
3 | 110120012021121020222011 |
4 | 1322120232130111201 |
5 | 4123112300033101 |
6 | 140211452512521 |
7 | 12331331610151 |
oct | 1723056342541 |
9 | 416167536864 |
10 | 131411330401 |
11 | 508052a759a |
12 | 2157547b741 |
13 | c5133bc590 |
14 | 6508aca761 |
15 | 3641be5751 |
hex | 1e98b9c561 |
131411330401 has 8 divisors (see below), whose sum is σ = 141536506664. Its totient is φ = 121288527360.
The previous prime is 131411330399. The next prime is 131411330419. The reversal of 131411330401 is 104033114131.
It can be written as a sum of positive squares in 4 ways, for example, as 233356176 + 131177974225 = 15276^2 + 362185^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131411330401 - 21 = 131411330399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131411330431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477456 + ... + 700561.
It is an arithmetic number, because the mean of its divisors is an integer number (17692063333).
Almost surely, 2131411330401 is an apocalyptic number.
It is an amenable number.
131411330401 is a deficient number, since it is larger than the sum of its proper divisors (10125176263).
131411330401 is a wasteful number, since it uses less digits than its factorization.
131411330401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1186611.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 131411330401 its reverse (104033114131), we get a palindrome (235444444532).
The spelling of 131411330401 in words is "one hundred thirty-one billion, four hundred eleven million, three hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •