Base | Representation |
---|---|
bin | 1110010011000111100001… |
… | …11110000011000101111001 |
3 | 11010022221101220111212211201 |
4 | 13021203300332003011321 |
5 | 13110131140032413103 |
6 | 150512450324454201 |
7 | 6423460615045612 |
oct | 711436076030571 |
9 | 133287356455751 |
10 | 31443203404153 |
11 | a022a95665332 |
12 | 3639aa124a361 |
13 | 1471109989798 |
14 | 7a9c05796c09 |
15 | 397d9ac9251d |
hex | 1c98f0f83179 |
31443203404153 has 2 divisors, whose sum is σ = 31443203404154. Its totient is φ = 31443203404152.
The previous prime is 31443203404139. The next prime is 31443203404189. The reversal of 31443203404153 is 35140430234413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30135126265209 + 1308077138944 = 5489547^2 + 1143712^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31443203404153 is a prime.
It is not a weakly prime, because it can be changed into another prime (31443203404133) 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 as a sum of consecutive naturals, namely, 15721601702076 + 15721601702077.
It is an arithmetic number, because the mean of its divisors is an integer number (15721601702077).
Almost surely, 231443203404153 is an apocalyptic number.
It is an amenable number.
31443203404153 is a deficient number, since it is larger than the sum of its proper divisors (1).
31443203404153 is an equidigital number, since it uses as much as digits as its factorization.
31443203404153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 31443203404153 its reverse (35140430234413), we get a palindrome (66583633638566).
The spelling of 31443203404153 in words is "thirty-one trillion, four hundred forty-three billion, two hundred three million, four hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •