Base | Representation |
---|---|
bin | 1001001100001110100000… |
… | …00101011000101000101001 |
3 | 2122120011221002122111121011 |
4 | 10212013100011120220221 |
5 | 10122120231410401413 |
6 | 110552540523543521 |
7 | 4154135105053330 |
oct | 446072005305051 |
9 | 78504832574534 |
10 | 20211312200233 |
11 | 6492629913750 |
12 | 232510768aba1 |
13 | b37bc310a4cb |
14 | 4dc33887ad17 |
15 | 250b214b833d |
hex | 1261d0158a29 |
20211312200233 has 32 divisors (see below), whose sum is σ = 25354489789440. Its totient is φ = 15651666884160.
The previous prime is 20211312200227. The next prime is 20211312200279. The reversal of 20211312200233 is 33200221311202.
It is a cyclic number.
It is not a de Polignac number, because 20211312200233 - 25 = 20211312200201 is a prime.
It is a super-2 number, since 2×202113122002332 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20211312200333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32555398 + ... + 33170416.
It is an arithmetic number, because the mean of its divisors is an integer number (792327805920).
Almost surely, 220211312200233 is an apocalyptic number.
It is an amenable number.
20211312200233 is a deficient number, since it is larger than the sum of its proper divisors (5143177589207).
20211312200233 is a wasteful number, since it uses less digits than its factorization.
20211312200233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617677.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 20211312200233 its reverse (33200221311202), we get a palindrome (53411533511435).
The spelling of 20211312200233 in words is "twenty trillion, two hundred eleven billion, three hundred twelve million, two hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •