Base | Representation |
---|---|
bin | 1001001110011011001001… |
… | …1111100010111110010101 |
3 | 1022220200220211222000101112 |
4 | 2103212302133202332111 |
5 | 2312142202033300041 |
6 | 33323452550304405 |
7 | 2064560133544565 |
oct | 223466237427625 |
9 | 38820824860345 |
10 | 10143412400021 |
11 | 326088495286a |
12 | 1179a40358105 |
13 | 58769a995414 |
14 | 270d2da34da5 |
15 | 128cc051adeb |
hex | 939b27e2f95 |
10143412400021 has 2 divisors, whose sum is σ = 10143412400022. Its totient is φ = 10143412400020.
The previous prime is 10143412399993. The next prime is 10143412400039. The reversal of 10143412400021 is 12000421434101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7325331706225 + 2818080693796 = 2706535^2 + 1678714^2 .
It is a cyclic number.
It is not a de Polignac number, because 10143412400021 - 230 = 10142338658197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10143412400021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10143412400321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071706200010 + 5071706200011.
It is an arithmetic number, because the mean of its divisors is an integer number (5071706200011).
Almost surely, 210143412400021 is an apocalyptic number.
It is an amenable number.
10143412400021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143412400021 is an equidigital number, since it uses as much as digits as its factorization.
10143412400021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 10143412400021 its reverse (12000421434101), we get a palindrome (22143833834122).
The spelling of 10143412400021 in words is "ten trillion, one hundred forty-three billion, four hundred twelve million, four hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •