Base | Representation |
---|---|
bin | 1001001001010001111110… |
… | …11011101110010011100001 |
3 | 2122012111200112010111122221 |
4 | 10210220333123232103201 |
5 | 10113440441341041113 |
6 | 110434241455031041 |
7 | 4143623024025412 |
oct | 444507733562341 |
9 | 78174615114587 |
10 | 20110101112033 |
11 | 6453711899109 |
12 | 230958020b481 |
13 | b2b4b372363a |
14 | 4d7496a41809 |
15 | 24d19aca298d |
hex | 124a3f6ee4e1 |
20110101112033 has 2 divisors, whose sum is σ = 20110101112034. Its totient is φ = 20110101112032.
The previous prime is 20110101111959. The next prime is 20110101112039. The reversal of 20110101112033 is 33021110101102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16691865882624 + 3418235229409 = 4085568^2 + 1848847^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110101112033 - 29 = 20110101111521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110101111998 and 20110101112016.
It is not a weakly prime, because it can be changed into another prime (20110101112039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055050556016 + 10055050556017.
It is an arithmetic number, because the mean of its divisors is an integer number (10055050556017).
Almost surely, 220110101112033 is an apocalyptic number.
It is an amenable number.
20110101112033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110101112033 is an equidigital number, since it uses as much as digits as its factorization.
20110101112033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 20110101112033 its reverse (33021110101102), we get a palindrome (53131211213135).
The spelling of 20110101112033 in words is "twenty trillion, one hundred ten billion, one hundred one million, one hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •