Base | Representation |
---|---|
bin | 100100101111100110101010… |
… | …0100010000010101000011001 |
3 | 1120101100210212020110102001011 |
4 | 1021133031110202002220121 |
5 | 314330320200030413423 |
6 | 3103220541114053521 |
7 | 125035400624243110 |
oct | 11137152442025031 |
9 | 1511323766412034 |
10 | 323202002201113 |
11 | 93a892214247a2 |
12 | 302ba86871a2a1 |
13 | 10b45a832a2aa9 |
14 | 59b50bb93ac77 |
15 | 275735c057b0d |
hex | 125f354882a19 |
323202002201113 has 16 divisors (see below), whose sum is σ = 376552709712000. Its totient is φ = 271669003454592.
The previous prime is 323202002201093. The next prime is 323202002201119. The reversal of 323202002201113 is 311102200202323.
It is a cyclic number.
It is not a de Polignac number, because 323202002201113 - 233 = 323193412266521 is a prime.
It is a super-3 number, since 3×3232020022011133 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (323202002201119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 956519878 + ... + 956857711.
It is an arithmetic number, because the mean of its divisors is an integer number (23534544357000).
Almost surely, 2323202002201113 is an apocalyptic number.
It is an amenable number.
323202002201113 is a deficient number, since it is larger than the sum of its proper divisors (53350707510887).
323202002201113 is a wasteful number, since it uses less digits than its factorization.
323202002201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1913378064.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 323202002201113 its reverse (311102200202323), we get a palindrome (634304202403436).
The spelling of 323202002201113 in words is "three hundred twenty-three trillion, two hundred two billion, two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •