Base | Representation |
---|---|
bin | 1011001101111000110000… |
… | …0000101100101010101101 |
3 | 1121200001010220211221212101 |
4 | 2303132030000230222231 |
5 | 3104031343211200023 |
6 | 42121443252335101 |
7 | 2412021124101352 |
oct | 263361400545255 |
9 | 47601126757771 |
10 | 12333200100013 |
11 | 3a25531a26691 |
12 | 147230b914491 |
13 | 6b6028888790 |
14 | 308d0417c629 |
15 | 165c351261ad |
hex | b378c02caad |
12333200100013 has 8 divisors (see below), whose sum is σ = 13281977951648. Its totient is φ = 11384432270064.
The previous prime is 12333200099999. The next prime is 12333200100031. The reversal of 12333200100013 is 31000100233321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12333200100013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12333200100043) 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, 155206 + ... + 4968952.
It is an arithmetic number, because the mean of its divisors is an integer number (1660247243956).
Almost surely, 212333200100013 is an apocalyptic number.
12333200100013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12333200100013 is a deficient number, since it is larger than the sum of its proper divisors (948777851635).
12333200100013 is a wasteful number, since it uses less digits than its factorization.
12333200100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5010843.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 12333200100013 its reverse (31000100233321), we get a palindrome (43333300333334).
The spelling of 12333200100013 in words is "twelve trillion, three hundred thirty-three billion, two hundred million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •