Base | Representation |
---|---|
bin | 1001000110110101101101… |
… | …0101000101100010010101 |
3 | 1022110020120020010002111201 |
4 | 2101231123111011202111 |
5 | 2303023312330140313 |
6 | 33143542145232501 |
7 | 2052264656236624 |
oct | 221553325054225 |
9 | 38406506102451 |
10 | 10013101021333 |
11 | 3210594538283 |
12 | 1158733332731 |
13 | 57830143a857 |
14 | 2688cb0736bb |
15 | 1256e519c0dd |
hex | 91b5b545895 |
10013101021333 has 2 divisors, whose sum is σ = 10013101021334. Its totient is φ = 10013101021332.
The previous prime is 10013101021283. The next prime is 10013101021367. The reversal of 10013101021333 is 33312010131001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6093995834404 + 3919105186929 = 2468602^2 + 1979673^2 .
It is a cyclic number.
It is not a de Polignac number, because 10013101021333 - 29 = 10013101020821 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10013101021333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10013101031333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006550510666 + 5006550510667.
It is an arithmetic number, because the mean of its divisors is an integer number (5006550510667).
Almost surely, 210013101021333 is an apocalyptic number.
It is an amenable number.
10013101021333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10013101021333 is an equidigital number, since it uses as much as digits as its factorization.
10013101021333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10013101021333 its reverse (33312010131001), we get a palindrome (43325111152334).
The spelling of 10013101021333 in words is "ten trillion, thirteen billion, one hundred one million, twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •