Base | Representation |
---|---|
bin | 101110100111110100… |
… | …0010101111000000101 |
3 | 100120102112212022112012 |
4 | 1131033220111320011 |
5 | 3120021234120422 |
6 | 113554455504005 |
7 | 10143033566366 |
oct | 1351750257005 |
9 | 316375768465 |
10 | 100120223237 |
11 | 3950828a651 |
12 | 174a2088005 |
13 | 95976b4158 |
14 | 4bbadd7b6d |
15 | 290ea864e2 |
hex | 174fa15e05 |
100120223237 has 2 divisors, whose sum is σ = 100120223238. Its totient is φ = 100120223236.
The previous prime is 100120223207. The next prime is 100120223263. The reversal of 100120223237 is 732322021001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82005485956 + 18114737281 = 286366^2 + 134591^2 .
It is an emirp because it is prime and its reverse (732322021001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100120223237 - 28 = 100120222981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100120223207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060111618 + 50060111619.
It is an arithmetic number, because the mean of its divisors is an integer number (50060111619).
Almost surely, 2100120223237 is an apocalyptic number.
It is an amenable number.
100120223237 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120223237 is an equidigital number, since it uses as much as digits as its factorization.
100120223237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 23.
Adding to 100120223237 its reverse (732322021001), we get a palindrome (832442244238).
The spelling of 100120223237 in words is "one hundred billion, one hundred twenty million, two hundred twenty-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •