Base | Representation |
---|---|
bin | 1001011001011010011100… |
… | …1100011110100111111001 |
3 | 1100120202012212210120000121 |
4 | 2112112213030132213321 |
5 | 2323240322030204423 |
6 | 33550314154133241 |
7 | 2114322403641556 |
oct | 226264714364771 |
9 | 40522185716017 |
10 | 10332201413113 |
11 | 3323953379628 |
12 | 11aa549421221 |
13 | 59c426456b18 |
14 | 27a11cc03a2d |
15 | 12db6e62645d |
hex | 965a731e9f9 |
10332201413113 has 8 divisors (see below), whose sum is σ = 10407072300800. Its totient is φ = 10257338218608.
The previous prime is 10332201413081. The next prime is 10332201413129. The reversal of 10332201413113 is 31131410223301.
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 10332201413113 - 25 = 10332201413081 is a prime.
It is a super-2 number, since 2×103322014131132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10332211413113) 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, 786283 + ... + 4613311.
It is an arithmetic number, because the mean of its divisors is an integer number (1300884037600).
Almost surely, 210332201413113 is an apocalyptic number.
It is an amenable number.
10332201413113 is a deficient number, since it is larger than the sum of its proper divisors (74870887687).
10332201413113 is a wasteful number, since it uses less digits than its factorization.
10332201413113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3846591.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10332201413113 its reverse (31131410223301), we get a palindrome (41463611636414).
The spelling of 10332201413113 in words is "ten trillion, three hundred thirty-two billion, two hundred one million, four hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •