Base | Representation |
---|---|
bin | 111110100110000… |
… | …0000100110100001 |
3 | 12102101002022020001 |
4 | 1331030000212201 |
5 | 13300134101233 |
6 | 544224420001 |
7 | 103022154115 |
oct | 17514004641 |
9 | 5371068201 |
10 | 2100300193 |
11 | 988623692 |
12 | 4a7477601 |
13 | 2761946a4 |
14 | 15cd27745 |
15 | c45c627d |
hex | 7d3009a1 |
2100300193 has 2 divisors, whose sum is σ = 2100300194. Its totient is φ = 2100300192.
The previous prime is 2100300157. The next prime is 2100300217. The reversal of 2100300193 is 3910030012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1481634064 + 618666129 = 38492^2 + 24873^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100300193 - 29 = 2100299681 is a prime.
It is a super-2 number, since 2×21003001932 = 8822521801431674498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2100300193.
It is not a weakly prime, because it can be changed into another prime (2100300133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050150096 + 1050150097.
It is an arithmetic number, because the mean of its divisors is an integer number (1050150097).
Almost surely, 22100300193 is an apocalyptic number.
It is an amenable number.
2100300193 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100300193 is an equidigital number, since it uses as much as digits as its factorization.
2100300193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
The square root of 2100300193 is about 45829.0322066700. The cubic root of 2100300193 is about 1280.6401812709.
The spelling of 2100300193 in words is "two billion, one hundred million, three hundred thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •