Base | Representation |
---|---|
bin | 1001100011011110011001… |
… | …01111101100100110110001 |
3 | 2202101112210101122021212102 |
4 | 10301233030233230212301 |
5 | 10223212211221202043 |
6 | 112403525501310145 |
7 | 4265634235142303 |
oct | 461571457544661 |
9 | 82345711567772 |
10 | 21010120100273 |
11 | 6770384078067 |
12 | 2433a9a865355 |
13 | b953270ca495 |
14 | 528c7676b973 |
15 | 2667c4cd06b8 |
hex | 131bccbec9b1 |
21010120100273 has 2 divisors, whose sum is σ = 21010120100274. Its totient is φ = 21010120100272.
The previous prime is 21010120100197. The next prime is 21010120100293. The reversal of 21010120100273 is 37200102101012.
It is an a-pointer prime, because the next prime (21010120100293) can be obtained adding 21010120100273 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12443446735729 + 8566673364544 = 3527527^2 + 2926888^2 .
It is a cyclic number.
It is not a de Polignac number, because 21010120100273 - 210 = 21010120099249 is a prime.
It is not a weakly prime, because it can be changed into another prime (21010120100293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505060050136 + 10505060050137.
It is an arithmetic number, because the mean of its divisors is an integer number (10505060050137).
Almost surely, 221010120100273 is an apocalyptic number.
It is an amenable number.
21010120100273 is a deficient number, since it is larger than the sum of its proper divisors (1).
21010120100273 is an equidigital number, since it uses as much as digits as its factorization.
21010120100273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 21010120100273 its reverse (37200102101012), we get a palindrome (58210222201285).
The spelling of 21010120100273 in words is "twenty-one trillion, ten billion, one hundred twenty million, one hundred thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •