Base | Representation |
---|---|
bin | 1110001100011000111100… |
… | …01010001100110010000111 |
3 | 11002111211201021020101101222 |
4 | 13012030132022030302013 |
5 | 13042334221013032221 |
6 | 150214335443510555 |
7 | 6400665165615011 |
oct | 706143612146207 |
9 | 132454637211358 |
10 | 31212033330311 |
11 | 9a43a49134329 |
12 | 360112698845b |
13 | 1455388a5b542 |
14 | 79c955acb1b1 |
15 | 391d6b11a9ab |
hex | 1c631e28cc87 |
31212033330311 has 8 divisors (see below), whose sum is σ = 31255991649840. Its totient is φ = 31168082207808.
The previous prime is 31212033330301. The next prime is 31212033330329. The reversal of 31212033330311 is 11303333021213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31212033330311 - 234 = 31194853461127 is a prime.
It is a super-2 number, since 2×312120333303112 (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 (31212033330301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6910100 + ... + 10496358.
It is an arithmetic number, because the mean of its divisors is an integer number (3906998956230).
Almost surely, 231212033330311 is an apocalyptic number.
31212033330311 is a deficient number, since it is larger than the sum of its proper divisors (43958319529).
31212033330311 is a wasteful number, since it uses less digits than its factorization.
31212033330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3598513.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 31212033330311 its reverse (11303333021213), we get a palindrome (42515366351524).
The spelling of 31212033330311 in words is "thirty-one trillion, two hundred twelve billion, thirty-three million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •