Base | Representation |
---|---|
bin | 1001011101100010100111… |
… | …0111111111001001001001 |
3 | 1100211112020212002100020201 |
4 | 2113120221313333021021 |
5 | 2330421034003131241 |
6 | 34043042502452201 |
7 | 2122412563214662 |
oct | 227305167771111 |
9 | 40745225070221 |
10 | 10403113333321 |
11 | 3350a322a4865 |
12 | 1200239734061 |
13 | 5a60177ac717 |
14 | 27d72899a369 |
15 | 13091ed1a931 |
hex | 97629dff249 |
10403113333321 has 2 divisors, whose sum is σ = 10403113333322. Its totient is φ = 10403113333320.
The previous prime is 10403113333307. The next prime is 10403113333339. The reversal of 10403113333321 is 12333331130401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5563394929225 + 4839718404096 = 2358685^2 + 2199936^2 .
It is a cyclic number.
It is not a de Polignac number, because 10403113333321 - 233 = 10394523398729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10403113333321.
It is not a weakly prime, because it can be changed into another prime (10403113333121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201556666660 + 5201556666661.
It is an arithmetic number, because the mean of its divisors is an integer number (5201556666661).
Almost surely, 210403113333321 is an apocalyptic number.
It is an amenable number.
10403113333321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10403113333321 is an equidigital number, since it uses as much as digits as its factorization.
10403113333321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 10403113333321 its reverse (12333331130401), we get a palindrome (22736444463722).
The spelling of 10403113333321 in words is "ten trillion, four hundred three billion, one hundred thirteen million, three hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •