Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …000100101011111001101001 |
3 | 111010102110121021002201000002 |
4 | 112300221121010223321221 |
5 | 101110014301030414233 |
6 | 552521150044552345 |
7 | 30040662240626231 |
oct | 2660513104537151 |
9 | 433373537081002 |
10 | 100100002201193 |
11 | 29993199706045 |
12 | b2880742526b5 |
13 | 43b150b246567 |
14 | 1aa0c1a286cc1 |
15 | b88c6dce16e8 |
hex | 5b0a5912be69 |
100100002201193 has 2 divisors, whose sum is σ = 100100002201194. Its totient is φ = 100100002201192.
The previous prime is 100100002201169. The next prime is 100100002201247. The reversal of 100100002201193 is 391102200001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62679474859369 + 37420527341824 = 7917037^2 + 6117232^2 .
It is a cyclic number.
It is not a de Polignac number, because 100100002201193 - 246 = 29731258023529 is a prime.
It is not a weakly prime, because it can be changed into another prime (100100002201153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050001100596 + 50050001100597.
It is an arithmetic number, because the mean of its divisors is an integer number (50050001100597).
Almost surely, 2100100002201193 is an apocalyptic number.
It is an amenable number.
100100002201193 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100002201193 is an equidigital number, since it uses as much as digits as its factorization.
100100002201193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 100100002201193 its reverse (391102200001001), we get a palindrome (491202202202194).
The spelling of 100100002201193 in words is "one hundred trillion, one hundred billion, two million, two hundred one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •