Base | Representation |
---|---|
bin | 1110010110011000001100… |
… | …10101110010110011111001 |
3 | 11010201122120022101111012122 |
4 | 13023030012111302303321 |
5 | 13114000103130201103 |
6 | 151040134551051025 |
7 | 6434535020542325 |
oct | 713140625626371 |
9 | 133648508344178 |
10 | 31555231100153 |
11 | a066553349462 |
12 | 3657747070a75 |
13 | 147b8512aa0b7 |
14 | 7b13d1da4985 |
15 | 39ac55dbdb38 |
hex | 1cb306572cf9 |
31555231100153 has 2 divisors, whose sum is σ = 31555231100154. Its totient is φ = 31555231100152.
The previous prime is 31555231100147. The next prime is 31555231100209. The reversal of 31555231100153 is 35100113255513.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26003350025104 + 5551881075049 = 5099348^2 + 2356243^2 .
It is a cyclic number.
It is not a de Polignac number, because 31555231100153 - 24 = 31555231100137 is a prime.
It is a super-2 number, since 2×315552311001532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31555231100353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15777615550076 + 15777615550077.
It is an arithmetic number, because the mean of its divisors is an integer number (15777615550077).
Almost surely, 231555231100153 is an apocalyptic number.
It is an amenable number.
31555231100153 is a deficient number, since it is larger than the sum of its proper divisors (1).
31555231100153 is an equidigital number, since it uses as much as digits as its factorization.
31555231100153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 33750, while the sum is 35.
Adding to 31555231100153 its reverse (35100113255513), we get a palindrome (66655344355666).
The spelling of 31555231100153 in words is "thirty-one trillion, five hundred fifty-five billion, two hundred thirty-one million, one hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •