Base | Representation |
---|---|
bin | 1001010010010011100111… |
… | …1111001101010000110001 |
3 | 1100011002002010111220221011 |
4 | 2110210321333031100301 |
5 | 2314240301143231142 |
6 | 33414243154230521 |
7 | 2102441022121504 |
oct | 224447177152061 |
9 | 40132063456834 |
10 | 10210110133297 |
11 | 32870a0aa1a88 |
12 | 118a955285441 |
13 | 590a69c15a99 |
14 | 274259c4113b |
15 | 12a8c5c7c417 |
hex | 94939fcd431 |
10210110133297 has 2 divisors, whose sum is σ = 10210110133298. Its totient is φ = 10210110133296.
The previous prime is 10210110133271. The next prime is 10210110133339. The reversal of 10210110133297 is 79233101101201.
10210110133297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10184325481521 + 25784651776 = 3191289^2 + 160576^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210110133297 - 215 = 10210110100529 is a prime.
It is not a weakly prime, because it can be changed into another prime (10210110133397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105055066648 + 5105055066649.
It is an arithmetic number, because the mean of its divisors is an integer number (5105055066649).
Almost surely, 210210110133297 is an apocalyptic number.
It is an amenable number.
10210110133297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210110133297 is an equidigital number, since it uses as much as digits as its factorization.
10210110133297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 31.
Adding to 10210110133297 its reverse (79233101101201), we get a palindrome (89443211234498).
The spelling of 10210110133297 in words is "ten trillion, two hundred ten billion, one hundred ten million, one hundred thirty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •