Base | Representation |
---|---|
bin | 111101001001101001… |
… | …0110110011110000101 |
3 | 110112221221010221002212 |
4 | 1322103102312132011 |
5 | 4122420433230313 |
6 | 140154435513205 |
7 | 12326144243663 |
oct | 1722322663605 |
9 | 415857127085 |
10 | 131320211333 |
11 | 50768921483 |
12 | 2154aa58805 |
13 | c4ca56817c |
14 | 64da96bc33 |
15 | 3638be73a8 |
hex | 1e934b6785 |
131320211333 has 4 divisors (see below), whose sum is σ = 131543926080. Its totient is φ = 131096496588.
The previous prime is 131320211317. The next prime is 131320211339. The reversal of 131320211333 is 333112023131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131320211333 - 24 = 131320211317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131320211299 and 131320211308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131320211339) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111856493 + ... + 111857666.
It is an arithmetic number, because the mean of its divisors is an integer number (32885981520).
Almost surely, 2131320211333 is an apocalyptic number.
It is an amenable number.
131320211333 is a deficient number, since it is larger than the sum of its proper divisors (223714747).
131320211333 is an equidigital number, since it uses as much as digits as its factorization.
131320211333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223714746.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 131320211333 its reverse (333112023131), we get a palindrome (464432234464).
The spelling of 131320211333 in words is "one hundred thirty-one billion, three hundred twenty million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •