Base | Representation |
---|---|
bin | 11101111000001010110111… |
… | …000001010111001010111001 |
3 | 122020021000212220121120000021 |
4 | 131320022313001113022321 |
5 | 114210402424302311101 |
6 | 1143245502004010441 |
7 | 36451401162225463 |
oct | 3570126701271271 |
9 | 566230786546007 |
10 | 131403300041401 |
11 | 38961910218463 |
12 | 128a2a0b390a21 |
13 | 584237ca8717b |
14 | 2463d4cb95133 |
15 | 102d17c2b85a1 |
hex | 7782b70572b9 |
131403300041401 has 2 divisors, whose sum is σ = 131403300041402. Its totient is φ = 131403300041400.
The previous prime is 131403300041399. The next prime is 131403300041483. The reversal of 131403300041401 is 104140003304131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87621787143801 + 43781512897600 = 9360651^2 + 6616760^2 .
It is a cyclic number.
It is not a de Polignac number, because 131403300041401 - 21 = 131403300041399 is a prime.
Together with 131403300041399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131403300048401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701650020700 + 65701650020701.
It is an arithmetic number, because the mean of its divisors is an integer number (65701650020701).
Almost surely, 2131403300041401 is an apocalyptic number.
It is an amenable number.
131403300041401 is a deficient number, since it is larger than the sum of its proper divisors (1).
131403300041401 is an equidigital number, since it uses as much as digits as its factorization.
131403300041401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 131403300041401 its reverse (104140003304131), we get a palindrome (235543303345532).
The spelling of 131403300041401 in words is "one hundred thirty-one trillion, four hundred three billion, three hundred million, forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •