Base | Representation |
---|---|
bin | 101101101101000111000010… |
… | …000011000101110011101111 |
3 | 222100201120011021211021021021 |
4 | 231231013002003011303233 |
5 | 202321340104110311343 |
6 | 1551303351442315011 |
7 | 60224432146421242 |
oct | 5555070203056357 |
9 | 870646137737237 |
10 | 201012020010223 |
11 | 5905979aa17894 |
12 | 1a665586958a67 |
13 | 88214768a71b6 |
14 | 378d0685b7259 |
15 | 1838bb5bca0ed |
hex | b6d1c20c5cef |
201012020010223 has 2 divisors, whose sum is σ = 201012020010224. Its totient is φ = 201012020010222.
The previous prime is 201012020010209. The next prime is 201012020010251. The reversal of 201012020010223 is 322010020210102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201012020010223 - 29 = 201012020009711 is a prime.
It is a super-2 number, since 2×2010120200102232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201012020010197 and 201012020010206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201012020010253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100506010005111 + 100506010005112.
It is an arithmetic number, because the mean of its divisors is an integer number (100506010005112).
Almost surely, 2201012020010223 is an apocalyptic number.
201012020010223 is a deficient number, since it is larger than the sum of its proper divisors (1).
201012020010223 is an equidigital number, since it uses as much as digits as its factorization.
201012020010223 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 201012020010223 its reverse (322010020210102), we get a palindrome (523022040220325).
The spelling of 201012020010223 in words is "two hundred one trillion, twelve billion, twenty million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •