Base | Representation |
---|---|
bin | 100011100111000011101001… |
… | …1001000011000100010010100 |
3 | 1112002001121111201211210100022 |
4 | 1013032013103020120202110 |
5 | 312023440010300321322 |
6 | 3030104233215004312 |
7 | 122656131303032501 |
oct | 10716072310304224 |
9 | 1462047451753308 |
10 | 313231212120212 |
11 | 9089467a359291 |
12 | 2b16a383209698 |
13 | 105a1765920589 |
14 | 574c685d504a8 |
15 | 2632ce16c5942 |
hex | 11ce1d3218894 |
313231212120212 has 12 divisors (see below), whose sum is σ = 580399010693460. Its totient is φ = 147402923350656.
The previous prime is 313231212120121. The next prime is 313231212120251. The reversal of 313231212120212 is 212021212132313.
It can be written as a sum of positive squares in 2 ways, for example, as 108777932871556 + 204453279248656 = 10429666^2 + 14298716^2 .
It is a super-2 number, since 2×3132312121202122 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2303170677287 + ... + 2303170677422.
It is an arithmetic number, because the mean of its divisors is an integer number (48366584224455).
Almost surely, 2313231212120212 is an apocalyptic number.
It is an amenable number.
313231212120212 is a deficient number, since it is larger than the sum of its proper divisors (267167798573248).
313231212120212 is a wasteful number, since it uses less digits than its factorization.
313231212120212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4606341354730 (or 4606341354728 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 313231212120212 its reverse (212021212132313), we get a palindrome (525252424252525).
The spelling of 313231212120212 in words is "three hundred thirteen trillion, two hundred thirty-one billion, two hundred twelve million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •