Base | Representation |
---|---|
bin | 1110001010000010100100… |
… | …01001111100101111100111 |
3 | 11002020010022220200101021120 |
4 | 13011001102021330233213 |
5 | 13040023401113114343 |
6 | 150113304500145023 |
7 | 6362106444652554 |
oct | 705012211745747 |
9 | 132203286611246 |
10 | 31131301301223 |
11 | 9a1278aaa1a32 |
12 | 35a9555998173 |
13 | 144a891081926 |
14 | 798a97a3ba2b |
15 | 38ebe374e683 |
hex | 1c505227cbe7 |
31131301301223 has 32 divisors (see below), whose sum is σ = 44786767173120. Its totient is φ = 19162860871680.
The previous prime is 31131301301183. The next prime is 31131301301227. The reversal of 31131301301223 is 32210310313113.
It is not a de Polignac number, because 31131301301223 - 212 = 31131301297127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31131301301193 and 31131301301202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31131301301227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9156858 + ... + 12087623.
It is an arithmetic number, because the mean of its divisors is an integer number (1399586474160).
Almost surely, 231131301301223 is an apocalyptic number.
31131301301223 is a deficient number, since it is larger than the sum of its proper divisors (13655465871897).
31131301301223 is a wasteful number, since it uses less digits than its factorization.
31131301301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21245047.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 31131301301223 its reverse (32210310313113), we get a palindrome (63341611614336).
The spelling of 31131301301223 in words is "thirty-one trillion, one hundred thirty-one billion, three hundred one million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •