Base | Representation |
---|---|
bin | 1001010010010011100111… |
… | …1111100000100000101111 |
3 | 1100011002002010122221002101 |
4 | 2110210321333200200233 |
5 | 2314240301203242033 |
6 | 33414243200035531 |
7 | 2102441022600412 |
oct | 224447177404057 |
9 | 40132063587071 |
10 | 10210110212143 |
11 | 32870a1046246 |
12 | 118a955302ba7 |
13 | 590a69c4293a |
14 | 274259c61b79 |
15 | 12a8c5c9597d |
hex | 94939fe082f |
10210110212143 has 2 divisors, whose sum is σ = 10210110212144. Its totient is φ = 10210110212142.
The previous prime is 10210110212033. The next prime is 10210110212209. The reversal of 10210110212143 is 34121201101201.
10210110212143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10210110212143 - 217 = 10210110081071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10210110212143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210110216143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105055106071 + 5105055106072.
It is an arithmetic number, because the mean of its divisors is an integer number (5105055106072).
Almost surely, 210210110212143 is an apocalyptic number.
10210110212143 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210110212143 is an equidigital number, since it uses as much as digits as its factorization.
10210110212143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10210110212143 its reverse (34121201101201), we get a palindrome (44331311313344).
The spelling of 10210110212143 in words is "ten trillion, two hundred ten billion, one hundred ten million, two hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •