Base | Representation |
---|---|
bin | 111101000110101100… |
… | …1001100100010111001 |
3 | 110112201000212012121202 |
4 | 1322031121030202321 |
5 | 4122220112230241 |
6 | 140140541543545 |
7 | 12323532615134 |
oct | 1721531144271 |
9 | 415630765552 |
10 | 131221211321 |
11 | 50717a53292 |
12 | 21521874bb5 |
13 | c4b2bb4895 |
14 | 64cb75b21b |
15 | 363018dd9b |
hex | 1e8d64c8b9 |
131221211321 has 8 divisors (see below), whose sum is σ = 133078116864. Its totient is φ = 129374593920.
The previous prime is 131221211281. The next prime is 131221211371. The reversal of 131221211321 is 123112122131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131221211321 - 222 = 131217017017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131221211293 and 131221211302.
It is not an unprimeable number, because it can be changed into a prime (131221211371) 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, 2546345 + ... + 2597366.
It is an arithmetic number, because the mean of its divisors is an integer number (16634764608).
Almost surely, 2131221211321 is an apocalyptic number.
It is an amenable number.
131221211321 is a deficient number, since it is larger than the sum of its proper divisors (1856905543).
131221211321 is an equidigital number, since it uses as much as digits as its factorization.
131221211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5144071.
The product of its digits is 144, while the sum is 20.
Adding to 131221211321 its reverse (123112122131), we get a palindrome (254333333452).
The spelling of 131221211321 in words is "one hundred thirty-one billion, two hundred twenty-one million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •