Base | Representation |
---|---|
bin | 101101101101000101010110… |
… | …110000111110101001111111 |
3 | 222100201101111211222100220221 |
4 | 231231011112300332221333 |
5 | 202321322412321201343 |
6 | 1551302453104122211 |
7 | 60224336432430232 |
oct | 5555052660765177 |
9 | 870641454870827 |
10 | 201010220100223 |
11 | 59058a56a14866 |
12 | 1a665164006367 |
13 | 882124aa190b1 |
14 | 378cd37525419 |
15 | 1838b0cb8d5ed |
hex | b6d156c3ea7f |
201010220100223 has 2 divisors, whose sum is σ = 201010220100224. Its totient is φ = 201010220100222.
The previous prime is 201010220100199. The next prime is 201010220100229. The reversal of 201010220100223 is 322001022010102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201010220100223 - 241 = 198811196844671 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201010220100197 and 201010220100206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010220100229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505110050111 + 100505110050112.
It is an arithmetic number, because the mean of its divisors is an integer number (100505110050112).
Almost surely, 2201010220100223 is an apocalyptic number.
201010220100223 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010220100223 is an equidigital number, since it uses as much as digits as its factorization.
201010220100223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 201010220100223 its reverse (322001022010102), we get a palindrome (523011242110325).
The spelling of 201010220100223 in words is "two hundred one trillion, ten billion, two hundred twenty million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •