Base | Representation |
---|---|
bin | 11101110100001111001111… |
… | …001010110001010110101011 |
3 | 122012022012111202101020120101 |
4 | 131310033033022301112223 |
5 | 114141441113242041413 |
6 | 1142521420311410231 |
7 | 36423025004523424 |
oct | 3564171712612653 |
9 | 565265452336511 |
10 | 131133122221483 |
11 | 38868276951488 |
12 | 1285a589383977 |
13 | 5822a53530b85 |
14 | 2454c3c61064b |
15 | 1026117d0aedd |
hex | 7743cf2b15ab |
131133122221483 has 2 divisors, whose sum is σ = 131133122221484. Its totient is φ = 131133122221482.
The previous prime is 131133122221301. The next prime is 131133122221531. The reversal of 131133122221483 is 384122221331131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131133122221483 is a prime.
It is not a weakly prime, because it can be changed into another prime (131133122221883) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65566561110741 + 65566561110742.
It is an arithmetic number, because the mean of its divisors is an integer number (65566561110742).
Almost surely, 2131133122221483 is an apocalyptic number.
131133122221483 is a deficient number, since it is larger than the sum of its proper divisors (1).
131133122221483 is an equidigital number, since it uses as much as digits as its factorization.
131133122221483 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 37.
The spelling of 131133122221483 in words is "one hundred thirty-one trillion, one hundred thirty-three billion, one hundred twenty-two million, two hundred twenty-one thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •