Base | Representation |
---|---|
bin | 1110001101000000001110… |
… | …00110100010011101000011 |
3 | 11002120212010221000211000221 |
4 | 13012200013012202131003 |
5 | 13043210413030043021 |
6 | 150232144200523511 |
7 | 6402342601640425 |
oct | 706400706423503 |
9 | 132525127024027 |
10 | 31233121331011 |
11 | 9a5198a822386 |
12 | 3605231180597 |
13 | 1457369975272 |
14 | 79d9966aa815 |
15 | 3926a264c241 |
hex | 1c68071a2743 |
31233121331011 has 4 divisors (see below), whose sum is σ = 31247902744072. Its totient is φ = 31218339917952.
The previous prime is 31233121330981. The next prime is 31233121331017. The reversal of 31233121331011 is 11013312133213.
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 31233121331011 - 221 = 31233119233859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31233121331017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7390703361 + ... + 7390707586.
It is an arithmetic number, because the mean of its divisors is an integer number (7811975686018).
Almost surely, 231233121331011 is an apocalyptic number.
31233121331011 is a deficient number, since it is larger than the sum of its proper divisors (14781413061).
31233121331011 is a wasteful number, since it uses less digits than its factorization.
31233121331011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14781413060.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 31233121331011 its reverse (11013312133213), we get a palindrome (42246433464224).
The spelling of 31233121331011 in words is "thirty-one trillion, two hundred thirty-three billion, one hundred twenty-one million, three hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •