Base | Representation |
---|---|
bin | 1110001010010111101101… |
… | …00111110101111000011101 |
3 | 11002021012121212021012211002 |
4 | 13011023312213311320131 |
5 | 13040220122014113303 |
6 | 150122423001440045 |
7 | 6362660624603162 |
oct | 705136647657035 |
9 | 132235555235732 |
10 | 31142650535453 |
11 | 9a17584381656 |
12 | 35ab7a27a0025 |
13 | 144b97c454a42 |
14 | 79945305a069 |
15 | 390159cc5788 |
hex | 1c52f69f5e1d |
31142650535453 has 8 divisors (see below), whose sum is σ = 33544103392800. Its totient is φ = 28817434276848.
The previous prime is 31142650535417. The next prime is 31142650535533. The reversal of 31142650535453 is 35453505624113.
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-31142650535453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31142650535398 and 31142650535407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31142650532453) 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, 19059148838 + ... + 19059150471.
It is an arithmetic number, because the mean of its divisors is an integer number (4193012924100).
Almost surely, 231142650535453 is an apocalyptic number.
It is an amenable number.
31142650535453 is a deficient number, since it is larger than the sum of its proper divisors (2401452857347).
31142650535453 is a wasteful number, since it uses less digits than its factorization.
31142650535453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38118299371.
The product of its (nonzero) digits is 3240000, while the sum is 47.
The spelling of 31142650535453 in words is "thirty-one trillion, one hundred forty-two billion, six hundred fifty million, five hundred thirty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •