Base | Representation |
---|---|
bin | 1001000110010001010001… |
… | …1110010001101000000101 |
3 | 1022102022022201202020210012 |
4 | 2101210110132101220011 |
5 | 2302343301003010341 |
6 | 33135243545440005 |
7 | 2051500436501546 |
oct | 221442436215005 |
9 | 38368281666705 |
10 | 10003322313221 |
11 | 3207426729126 |
12 | 11568644a0005 |
13 | 577403550b33 |
14 | 2682404764cd |
15 | 1253219520eb |
hex | 91914791a05 |
10003322313221 has 2 divisors, whose sum is σ = 10003322313222. Its totient is φ = 10003322313220.
The previous prime is 10003322313217. The next prime is 10003322313233. The reversal of 10003322313221 is 12231322330001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7727566022500 + 2275756290721 = 2779850^2 + 1508561^2 .
It is a cyclic number.
It is not a de Polignac number, because 10003322313221 - 22 = 10003322313217 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10003322313421) 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 as a sum of consecutive naturals, namely, 5001661156610 + 5001661156611.
It is an arithmetic number, because the mean of its divisors is an integer number (5001661156611).
Almost surely, 210003322313221 is an apocalyptic number.
It is an amenable number.
10003322313221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10003322313221 is an equidigital number, since it uses as much as digits as its factorization.
10003322313221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10003322313221 its reverse (12231322330001), we get a palindrome (22234644643222).
The spelling of 10003322313221 in words is "ten trillion, three billion, three hundred twenty-two million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •