Base | Representation |
---|---|
bin | 11101110010010011010110… |
… | …101010100110110101001001 |
3 | 122011211111011111011112200101 |
4 | 131302103112222212311021 |
5 | 114132301203112140241 |
6 | 1142340341134005401 |
7 | 36410305461501613 |
oct | 3562232652466511 |
9 | 564744144145611 |
10 | 131000104021321 |
11 | 38816917610957 |
12 | 12838845946861 |
13 | 58133452719b2 |
14 | 244c620361db3 |
15 | 102293000ae31 |
hex | 7724d6aa6d49 |
131000104021321 has 2 divisors, whose sum is σ = 131000104021322. Its totient is φ = 131000104021320.
The previous prime is 131000104021211. The next prime is 131000104021327. The reversal of 131000104021321 is 123120401000131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88180814135296 + 42819289886025 = 9390464^2 + 6543645^2 .
It is a cyclic number.
It is not a de Polignac number, because 131000104021321 - 211 = 131000104019273 is a prime.
It is a super-2 number, since 2×1310001040213212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131000104021327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500052010660 + 65500052010661.
It is an arithmetic number, because the mean of its divisors is an integer number (65500052010661).
Almost surely, 2131000104021321 is an apocalyptic number.
It is an amenable number.
131000104021321 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000104021321 is an equidigital number, since it uses as much as digits as its factorization.
131000104021321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 131000104021321 its reverse (123120401000131), we get a palindrome (254120505021452).
The spelling of 131000104021321 in words is "one hundred thirty-one trillion, one hundred four million, twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •