Base | Representation |
---|---|
bin | 101101111100111101001110… |
… | …010100100010111010110001 |
3 | 222111120200000012000201021222 |
4 | 231330331032110202322301 |
5 | 202442210322012401113 |
6 | 1553455530121354425 |
7 | 60366213120561005 |
oct | 5574751624427261 |
9 | 874520005021258 |
10 | 202101000122033 |
11 | 59439609896771 |
12 | 1a800640038a15 |
13 | 88a00725b356c |
14 | 37c9a522b4705 |
15 | 185719deade08 |
hex | b7cf4e522eb1 |
202101000122033 has 2 divisors, whose sum is σ = 202101000122034. Its totient is φ = 202101000122032.
The previous prime is 202101000122009. The next prime is 202101000122039. The reversal of 202101000122033 is 330221000101202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 167250254605729 + 34850745516304 = 12932527^2 + 5903452^2 .
It is a cyclic number.
It is not a de Polignac number, because 202101000122033 - 222 = 202100995927729 is a prime.
It is a super-3 number, since 3×2021010001220333 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (202101000122039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101050500061016 + 101050500061017.
It is an arithmetic number, because the mean of its divisors is an integer number (101050500061017).
Almost surely, 2202101000122033 is an apocalyptic number.
It is an amenable number.
202101000122033 is a deficient number, since it is larger than the sum of its proper divisors (1).
202101000122033 is an equidigital number, since it uses as much as digits as its factorization.
202101000122033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 202101000122033 its reverse (330221000101202), we get a palindrome (532322000223235).
The spelling of 202101000122033 in words is "two hundred two trillion, one hundred one billion, one hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •