Base | Representation |
---|---|
bin | 11101110111000111101000… |
… | …110101000011100110101111 |
3 | 122020000010120122110010221102 |
4 | 131313013220311003212233 |
5 | 114203212114013413203 |
6 | 1143152403441353315 |
7 | 36443234420405636 |
oct | 3567075065034657 |
9 | 566003518403842 |
10 | 131331121232303 |
11 | 3893424115a913 |
12 | 12890a2693883b |
13 | 583861911a685 |
14 | 2460662a5a51d |
15 | 102b355774888 |
hex | 7771e8d439af |
131331121232303 has 8 divisors (see below), whose sum is σ = 131574425836080. Its totient is φ = 131087818653120.
The previous prime is 131331121232257. The next prime is 131331121232321. The reversal of 131331121232303 is 303232121133131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131331121232303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131331121232803) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211316468 + ... + 211937046.
It is an arithmetic number, because the mean of its divisors is an integer number (16446803229510).
Almost surely, 2131331121232303 is an apocalyptic number.
131331121232303 is a deficient number, since it is larger than the sum of its proper divisors (243304603777).
131331121232303 is an equidigital number, since it uses as much as digits as its factorization.
131331121232303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012297.
The product of its (nonzero) digits is 5832, while the sum is 29.
Adding to 131331121232303 its reverse (303232121133131), we get a palindrome (434563242365434).
The spelling of 131331121232303 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, one hundred twenty-one million, two hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •