Base | Representation |
---|---|
bin | 1110010000001101011111… |
… | …00001010101111101010001 |
3 | 11002222101120221100201221202 |
4 | 13020012233201111331101 |
5 | 13102012110201044101 |
6 | 150354531204400545 |
7 | 6413323500425054 |
oct | 710065741257521 |
9 | 132871527321852 |
10 | 31343321112401 |
11 | 9a9469a716181 |
12 | 36226669a6155 |
13 | 146487c680abc |
14 | 7a504c216a9b |
15 | 3954a205936b |
hex | 1c81af855f51 |
31343321112401 has 2 divisors, whose sum is σ = 31343321112402. Its totient is φ = 31343321112400.
The previous prime is 31343321112373. The next prime is 31343321112431. The reversal of 31343321112401 is 10421112334313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30962324784400 + 380996328001 = 5564380^2 + 617249^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31343321112401 is a prime.
It is not a weakly prime, because it can be changed into another prime (31343321112431) 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, 15671660556200 + 15671660556201.
It is an arithmetic number, because the mean of its divisors is an integer number (15671660556201).
Almost surely, 231343321112401 is an apocalyptic number.
It is an amenable number.
31343321112401 is a deficient number, since it is larger than the sum of its proper divisors (1).
31343321112401 is an equidigital number, since it uses as much as digits as its factorization.
31343321112401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 31343321112401 its reverse (10421112334313), we get a palindrome (41764433446714).
The spelling of 31343321112401 in words is "thirty-one trillion, three hundred forty-three billion, three hundred twenty-one million, one hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •