Base | Representation |
---|---|
bin | 100011100110111011001110… |
… | …1100010110010111001110001 |
3 | 1112001222212211210011202010220 |
4 | 1013031312131202302321301 |
5 | 312023140444100030410 |
6 | 3030052043233043253 |
7 | 122654621265553260 |
oct | 10715663542627161 |
9 | 1461885753152126 |
10 | 313213133205105 |
11 | 90887a42276831 |
12 | 2b1669786b6529 |
13 | 1059cb4424c683 |
14 | 574b84cc605d7 |
15 | 26325d4430070 |
hex | 11cdd9d8b2e71 |
313213133205105 has 32 divisors (see below), whose sum is σ = 575128957132800. Its totient is φ = 142584053932992.
The previous prime is 313213133205047. The next prime is 313213133205121. The reversal of 313213133205105 is 501502331312313.
It is not a de Polignac number, because 313213133205105 - 224 = 313213116427889 is a prime.
It is a super-2 number, since 2×3132131332051052 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6240523485 + ... + 6240573674.
It is an arithmetic number, because the mean of its divisors is an integer number (17972779910400).
Almost surely, 2313213133205105 is an apocalyptic number.
313213133205105 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
313213133205105 is a deficient number, since it is larger than the sum of its proper divisors (261915823927695).
313213133205105 is a wasteful number, since it uses less digits than its factorization.
313213133205105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12481097413.
The product of its (nonzero) digits is 24300, while the sum is 33.
Adding to 313213133205105 its reverse (501502331312313), we get a palindrome (814715464517418).
The spelling of 313213133205105 in words is "three hundred thirteen trillion, two hundred thirteen billion, one hundred thirty-three million, two hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •