Base | Representation |
---|---|
bin | 1110000111001000010100… |
… | …01110100101111110100011 |
3 | 11001212120020100222210120120 |
4 | 13003210022032211332203 |
5 | 13031404110414430311 |
6 | 145555330454211323 |
7 | 6351636540401601 |
oct | 703441216457643 |
9 | 131776210883516 |
10 | 31031310311331 |
11 | 9984339760300 |
12 | 35920ab053b43 |
13 | 14413173a8315 |
14 | 793ccdc84871 |
15 | 38c2e01e4706 |
hex | 1c390a3a5fa3 |
31031310311331 has 48 divisors (see below), whose sum is σ = 45913738214400. Its totient is φ = 18627063840000.
The previous prime is 31031310311299. The next prime is 31031310311341. The reversal of 31031310311331 is 13311301313013.
It is not a de Polignac number, because 31031310311331 - 25 = 31031310311299 is a prime.
It is a super-2 number, since 2×310313103113312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31031310311341) 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 in 47 ways as a sum of consecutive naturals, for example, 57115206 + ... + 57655956.
It is an arithmetic number, because the mean of its divisors is an integer number (956536212800).
Almost surely, 231031310311331 is an apocalyptic number.
31031310311331 is a deficient number, since it is larger than the sum of its proper divisors (14882427903069).
31031310311331 is a wasteful number, since it uses less digits than its factorization.
31031310311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542288 (or 542277 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 24.
Adding to 31031310311331 its reverse (13311301313013), we get a palindrome (44342611624344).
The spelling of 31031310311331 in words is "thirty-one trillion, thirty-one billion, three hundred ten million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •