Base | Representation |
---|---|
bin | 101110101101110111… |
… | …0110010110100111001 |
3 | 100120221200212200220201 |
4 | 1131123232302310321 |
5 | 3120430222210043 |
6 | 114030551122201 |
7 | 10151050323613 |
oct | 1353356626471 |
9 | 316850780821 |
10 | 100323241273 |
11 | 39601944052 |
12 | 1753a073361 |
13 | 95ca787078 |
14 | 4bd9d63db3 |
15 | 29227d9c4d |
hex | 175bbb2d39 |
100323241273 has 2 divisors, whose sum is σ = 100323241274. Its totient is φ = 100323241272.
The previous prime is 100323241199. The next prime is 100323241301. The reversal of 100323241273 is 372142323001.
It is an a-pointer prime, because the next prime (100323241301) can be obtained adding 100323241273 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91365943824 + 8957297449 = 302268^2 + 94643^2 .
It is a cyclic number.
It is not a de Polignac number, because 100323241273 - 217 = 100323110201 is a prime.
It is not a weakly prime, because it can be changed into another prime (100323241373) 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, 50161620636 + 50161620637.
It is an arithmetic number, because the mean of its divisors is an integer number (50161620637).
Almost surely, 2100323241273 is an apocalyptic number.
It is an amenable number.
100323241273 is a deficient number, since it is larger than the sum of its proper divisors (1).
100323241273 is an equidigital number, since it uses as much as digits as its factorization.
100323241273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 28.
Adding to 100323241273 its reverse (372142323001), we get a palindrome (472465564274).
The spelling of 100323241273 in words is "one hundred billion, three hundred twenty-three million, two hundred forty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •