Base | Representation |
---|---|
bin | 11101111000010011111011… |
… | …100100110111100010110001 |
3 | 122020021222000201022112122111 |
4 | 131320103323210313202301 |
5 | 114211032401233244241 |
6 | 1143254152304005321 |
7 | 36452164432524031 |
oct | 3570237344674261 |
9 | 566258021275574 |
10 | 131413040134321 |
11 | 38965a59252430 |
12 | 128a4889300841 |
13 | 584327297376a |
14 | 24645d45bd8c1 |
15 | 102d54c436c81 |
hex | 7784fb9378b1 |
131413040134321 has 32 divisors (see below), whose sum is σ = 145582254268416. Its totient is φ = 117620134992000.
The previous prime is 131413040134319. The next prime is 131413040134357. The reversal of 131413040134321 is 123431040314131.
It is a cyclic number.
It is not a de Polignac number, because 131413040134321 - 21 = 131413040134319 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131413040134301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5249999076 + ... + 5250024106.
It is an arithmetic number, because the mean of its divisors is an integer number (4549445445888).
Almost surely, 2131413040134321 is an apocalyptic number.
131413040134321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131413040134321 is a deficient number, since it is larger than the sum of its proper divisors (14169214134095).
131413040134321 is a wasteful number, since it uses less digits than its factorization.
131413040134321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36493.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 131413040134321 its reverse (123431040314131), we get a palindrome (254844080448452).
The spelling of 131413040134321 in words is "one hundred thirty-one trillion, four hundred thirteen billion, forty million, one hundred thirty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •