Base | Representation |
---|---|
bin | 1110010110000011111010… |
… | …10100111001101110010111 |
3 | 11010200121110110110220120001 |
4 | 13023001331110321232113 |
5 | 13113310303132000033 |
6 | 151031134301352131 |
7 | 6434001132554632 |
oct | 713017524715627 |
9 | 133617413426501 |
10 | 31544342453143 |
11 | a061975a56833 |
12 | 3655608568647 |
13 | 147a80746c8c0 |
14 | 7b0a7bbdcc19 |
15 | 39a819ec7e7d |
hex | 1cb07d539b97 |
31544342453143 has 4 divisors (see below), whose sum is σ = 33970830334168. Its totient is φ = 29117854572120.
The previous prime is 31544342453137. The next prime is 31544342453159. The reversal of 31544342453143 is 34135424344513.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31544342453143 - 229 = 31543805582231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31544342453093 and 31544342453102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31544342451143) 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, 1213243940493 + ... + 1213243940518.
It is an arithmetic number, because the mean of its divisors is an integer number (8492707583542).
Almost surely, 231544342453143 is an apocalyptic number.
31544342453143 is a deficient number, since it is larger than the sum of its proper divisors (2426487881025).
31544342453143 is a wasteful number, since it uses less digits than its factorization.
31544342453143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2426487881024.
The product of its digits is 4147200, while the sum is 46.
Adding to 31544342453143 its reverse (34135424344513), we get a palindrome (65679766797656).
The spelling of 31544342453143 in words is "thirty-one trillion, five hundred forty-four billion, three hundred forty-two million, four hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •