Base | Representation |
---|---|
bin | 1110001001001000110111… |
… | …00110101011001000011111 |
3 | 11002010011100212100221012212 |
4 | 13010210123212223020133 |
5 | 13034021424224011221 |
6 | 150051142415351035 |
7 | 6356631645262235 |
oct | 704443346531037 |
9 | 132104325327185 |
10 | 31100321313311 |
11 | 9a00632663538 |
12 | 35a354a82247b |
13 | 1447994968433 |
14 | 7973993b4955 |
15 | 38decda98b5b |
hex | 1c491b9ab21f |
31100321313311 has 4 divisors (see below), whose sum is σ = 31762030277472. Its totient is φ = 30438612349152.
The previous prime is 31100321313289. The next prime is 31100321313319. The reversal of 31100321313311 is 11331312300113.
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 31100321313311 - 26 = 31100321313247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31100321313319) 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 3 ways as a sum of consecutive naturals, for example, 330854482010 + ... + 330854482103.
It is an arithmetic number, because the mean of its divisors is an integer number (7940507569368).
Almost surely, 231100321313311 is an apocalyptic number.
31100321313311 is a deficient number, since it is larger than the sum of its proper divisors (661708964161).
31100321313311 is an equidigital number, since it uses as much as digits as its factorization.
31100321313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661708964160.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 31100321313311 its reverse (11331312300113), we get a palindrome (42431633613424).
The spelling of 31100321313311 in words is "thirty-one trillion, one hundred billion, three hundred twenty-one million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •