Base | Representation |
---|---|
bin | 1001011000110001011101… |
… | …1101110011101011100001 |
3 | 1100112200211011220001102122 |
4 | 2112030113131303223201 |
5 | 2323100304211231423 |
6 | 33541254401554025 |
7 | 2113452650225555 |
oct | 226142735635341 |
9 | 40480734801378 |
10 | 10321200102113 |
11 | 331a21842586a |
12 | 11a8399045915 |
13 | 59b392190844 |
14 | 279797ab1865 |
15 | 12d7288c88c8 |
hex | 96317773ae1 |
10321200102113 has 16 divisors (see below), whose sum is σ = 10777228474320. Its totient is φ = 9871939037184.
The previous prime is 10321200102091. The next prime is 10321200102163. The reversal of 10321200102113 is 31120100212301.
It can be written as a sum of positive squares in 8 ways, for example, as 752924114944 + 9568275987169 = 867712^2 + 3093263^2 .
It is a cyclic number.
It is not a de Polignac number, because 10321200102113 - 216 = 10321200036577 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10321200102091 and 10321200102100.
It is not an unprimeable number, because it can be changed into a prime (10321200102163) 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, 5445695 + ... + 7092107.
It is an arithmetic number, because the mean of its divisors is an integer number (673576779645).
Almost surely, 210321200102113 is an apocalyptic number.
It is an amenable number.
10321200102113 is a deficient number, since it is larger than the sum of its proper divisors (456028372207).
10321200102113 is a wasteful number, since it uses less digits than its factorization.
10321200102113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1648468.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10321200102113 its reverse (31120100212301), we get a palindrome (41441300314414).
The spelling of 10321200102113 in words is "ten trillion, three hundred twenty-one billion, two hundred million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •