Base | Representation |
---|---|
bin | 1001011000110001100001… |
… | …0000001100010010010111 |
3 | 1100112200212002202002101110 |
4 | 2112030120100030102113 |
5 | 2323100321101410403 |
6 | 33541255553030103 |
7 | 2113453200416043 |
oct | 226143020142227 |
9 | 40480762662343 |
10 | 10321213310103 |
11 | 331a224927163 |
12 | 11a83a1555333 |
13 | 59b394b36617 |
14 | 27979974d023 |
15 | 12d729b37103 |
hex | 9631840c497 |
10321213310103 has 32 divisors (see below), whose sum is σ = 13827779182080. Its totient is φ = 6847825259520.
The previous prime is 10321213310099. The next prime is 10321213310117. The reversal of 10321213310103 is 30101331212301.
It is a happy number.
It is not a de Polignac number, because 10321213310103 - 22 = 10321213310099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10321213310103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10321213310183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1179158575 + ... + 1179167327.
It is an arithmetic number, because the mean of its divisors is an integer number (432118099440).
Almost surely, 210321213310103 is an apocalyptic number.
10321213310103 is a deficient number, since it is larger than the sum of its proper divisors (3506565871977).
10321213310103 is a wasteful number, since it uses less digits than its factorization.
10321213310103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11319.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10321213310103 its reverse (30101331212301), we get a palindrome (40422544522404).
The spelling of 10321213310103 in words is "ten trillion, three hundred twenty-one billion, two hundred thirteen million, three hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •