Base | Representation |
---|---|
bin | 1110001001001101110111… |
… | …11110111101001100111101 |
3 | 11002010102022101102200012021 |
4 | 13010212323332331030331 |
5 | 13034042432040031331 |
6 | 150052305415040141 |
7 | 6360055430105113 |
oct | 704467376751475 |
9 | 132112271380167 |
10 | 31103012033341 |
11 | 9a017934912a6 |
12 | 35a3b7b970051 |
13 | 1448003252c71 |
14 | 7975728adab3 |
15 | 38e0d9de9211 |
hex | 1c49bbfbd33d |
31103012033341 has 2 divisors, whose sum is σ = 31103012033342. Its totient is φ = 31103012033340.
The previous prime is 31103012033239. The next prime is 31103012033371. The reversal of 31103012033341 is 14333021030113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23502900384441 + 7600111648900 = 4847979^2 + 2756830^2 .
It is a cyclic number.
It is not a de Polignac number, because 31103012033341 - 211 = 31103012031293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31103012033371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15551506016670 + 15551506016671.
It is an arithmetic number, because the mean of its divisors is an integer number (15551506016671).
Almost surely, 231103012033341 is an apocalyptic number.
It is an amenable number.
31103012033341 is a deficient number, since it is larger than the sum of its proper divisors (1).
31103012033341 is an equidigital number, since it uses as much as digits as its factorization.
31103012033341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 31103012033341 its reverse (14333021030113), we get a palindrome (45436033063454).
The spelling of 31103012033341 in words is "thirty-one trillion, one hundred three billion, twelve million, thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •