Base | Representation |
---|---|
bin | 1001010010010011001110… |
… | …0011001111110010101101 |
3 | 1100011001210121022022102202 |
4 | 2110210303203033302231 |
5 | 2314240041021442313 |
6 | 33414224335431245 |
7 | 2102435241156302 |
oct | 224446343176255 |
9 | 40131717268382 |
10 | 10210002140333 |
11 | 32870460412a6 |
12 | 118a925085525 |
13 | 590a50734118 |
14 | 27424976d0a9 |
15 | 12a8bb549558 |
hex | 949338cfcad |
10210002140333 has 2 divisors, whose sum is σ = 10210002140334. Its totient is φ = 10210002140332.
The previous prime is 10210002140263. The next prime is 10210002140389. The reversal of 10210002140333 is 33304120001201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9714953401924 + 495048738409 = 3116882^2 + 703597^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10210002140333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210002140633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105001070166 + 5105001070167.
It is an arithmetic number, because the mean of its divisors is an integer number (5105001070167).
Almost surely, 210210002140333 is an apocalyptic number.
It is an amenable number.
10210002140333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210002140333 is an equidigital number, since it uses as much as digits as its factorization.
10210002140333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10210002140333 its reverse (33304120001201), we get a palindrome (43514122141534).
The spelling of 10210002140333 in words is "ten trillion, two hundred ten billion, two million, one hundred forty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •