Base | Representation |
---|---|
bin | 1110000111000111111111… |
… | …00010111101010001000111 |
3 | 11001212112202212202221011102 |
4 | 13003203333202331101013 |
5 | 13031403224030201411 |
6 | 145555301013130315 |
7 | 6351632233210343 |
oct | 703437742752107 |
9 | 131775685687142 |
10 | 31031131100231 |
11 | 9984257587359 |
12 | 359205b02999b |
13 | 14412b921c552 |
14 | 793cb4154623 |
15 | 38c2ce5e4d3b |
hex | 1c38ff8bd447 |
31031131100231 has 4 divisors (see below), whose sum is σ = 31616624139912. Its totient is φ = 30445638060552.
The previous prime is 31031131100197. The next prime is 31031131100267. The reversal of 31031131100231 is 13200113113013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31031131100231 - 218 = 31031130838087 is a prime.
It is a super-2 number, since 2×310311311002312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31031131100731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 292746519761 + ... + 292746519866.
It is an arithmetic number, because the mean of its divisors is an integer number (7904156034978).
Almost surely, 231031131100231 is an apocalyptic number.
31031131100231 is a deficient number, since it is larger than the sum of its proper divisors (585493039681).
31031131100231 is an equidigital number, since it uses as much as digits as its factorization.
31031131100231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 585493039680.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 31031131100231 its reverse (13200113113013), we get a palindrome (44231244213244).
The spelling of 31031131100231 in words is "thirty-one trillion, thirty-one billion, one hundred thirty-one million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •