Base | Representation |
---|---|
bin | 1001001001101010011001… |
… | …10010111011001111100001 |
3 | 2122020202112010012011201201 |
4 | 10210311030302323033201 |
5 | 10114144313302400113 |
6 | 110444250344201201 |
7 | 4144565623316023 |
oct | 444651462731741 |
9 | 78222463164651 |
10 | 20123210200033 |
11 | 6459229601a36 |
12 | 231001a469201 |
13 | b2c7c259b545 |
14 | 4d7d7ba86013 |
15 | 24d6b6aa1cdd |
hex | 124d4ccbb3e1 |
20123210200033 has 2 divisors, whose sum is σ = 20123210200034. Its totient is φ = 20123210200032.
The previous prime is 20123210200021. The next prime is 20123210200069. The reversal of 20123210200033 is 33000201232102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10345537736704 + 9777672463329 = 3216448^2 + 3126927^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20123210200033 is a prime.
It is not a weakly prime, because it can be changed into another prime (20123210200073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061605100016 + 10061605100017.
It is an arithmetic number, because the mean of its divisors is an integer number (10061605100017).
Almost surely, 220123210200033 is an apocalyptic number.
It is an amenable number.
20123210200033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20123210200033 is an equidigital number, since it uses as much as digits as its factorization.
20123210200033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20123210200033 its reverse (33000201232102), we get a palindrome (53123411432135).
The spelling of 20123210200033 in words is "twenty trillion, one hundred twenty-three billion, two hundred ten million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •