Base | Representation |
---|---|
bin | 11110100011111001101… |
… | …111000000110010100101 |
3 | 21102202210221102120110111 |
4 | 132203321233000302211 |
5 | 233402033234004422 |
6 | 4244442125453021 |
7 | 304505163352024 |
oct | 36437157006245 |
9 | 7382727376414 |
10 | 2100133891237 |
11 | 73a7309163a8 |
12 | 29b02a711171 |
13 | 123070a227a5 |
14 | 7390b6048bb |
15 | 39968d63a77 |
hex | 1e8f9bc0ca5 |
2100133891237 has 2 divisors, whose sum is σ = 2100133891238. Its totient is φ = 2100133891236.
The previous prime is 2100133891231. The next prime is 2100133891249. The reversal of 2100133891237 is 7321983310012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2088296668836 + 11837222401 = 1445094^2 + 108799^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100133891237 - 227 = 2099999673509 is a prime.
It is a super-2 number, since 2×21001338912372 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2100133891237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100133891231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050066945618 + 1050066945619.
It is an arithmetic number, because the mean of its divisors is an integer number (1050066945619).
Almost surely, 22100133891237 is an apocalyptic number.
It is an amenable number.
2100133891237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100133891237 is an equidigital number, since it uses as much as digits as its factorization.
2100133891237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54432, while the sum is 40.
The spelling of 2100133891237 in words is "two trillion, one hundred billion, one hundred thirty-three million, eight hundred ninety-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •