Base | Representation |
---|---|
bin | 11110100011111000010… |
… | …101000001001110000001 |
3 | 21102202202022001000102012 |
4 | 132203320111001032001 |
5 | 233402011214100113 |
6 | 4244435524102305 |
7 | 304504456005014 |
oct | 36437025011601 |
9 | 7382668030365 |
10 | 2100110300033 |
11 | 73a719572a39 |
12 | 29b022834995 |
13 | 123068b828b5 |
14 | 7390842337b |
15 | 39966c53aa8 |
hex | 1e8f8541381 |
2100110300033 has 2 divisors, whose sum is σ = 2100110300034. Its totient is φ = 2100110300032.
The previous prime is 2100110299981. The next prime is 2100110300053. The reversal of 2100110300033 is 3300030110012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2042564047489 + 57546252544 = 1429183^2 + 239888^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2100110300033 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2100110299990 and 2100110300017.
It is not a weakly prime, because it can be changed into another prime (2100110300053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050055150016 + 1050055150017.
It is an arithmetic number, because the mean of its divisors is an integer number (1050055150017).
Almost surely, 22100110300033 is an apocalyptic number.
It is an amenable number.
2100110300033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100110300033 is an equidigital number, since it uses as much as digits as its factorization.
2100110300033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 2100110300033 its reverse (3300030110012), we get a palindrome (5400140410045).
The spelling of 2100110300033 in words is "two trillion, one hundred billion, one hundred ten million, three hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •