Base | Representation |
---|---|
bin | 101110101011011010… |
… | …1100010110001000101 |
3 | 100120201222100201202211 |
4 | 1131112311202301011 |
5 | 3120243211440141 |
6 | 114014455103421 |
7 | 10146032333104 |
oct | 1352665426105 |
9 | 316658321684 |
10 | 100241124421 |
11 | 3956a557489 |
12 | 17516671b71 |
13 | 95b6765309 |
14 | 4bcd0aa03b |
15 | 291a4b8d81 |
hex | 1756d62c45 |
100241124421 has 2 divisors, whose sum is σ = 100241124422. Its totient is φ = 100241124420.
The previous prime is 100241124391. The next prime is 100241124437. The reversal of 100241124421 is 124421142001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97243561921 + 2997562500 = 311839^2 + 54750^2 .
It is a cyclic number.
It is not a de Polignac number, because 100241124421 - 29 = 100241123909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100241124392 and 100241124401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100241124821) 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, 50120562210 + 50120562211.
It is an arithmetic number, because the mean of its divisors is an integer number (50120562211).
Almost surely, 2100241124421 is an apocalyptic number.
It is an amenable number.
100241124421 is a deficient number, since it is larger than the sum of its proper divisors (1).
100241124421 is an equidigital number, since it uses as much as digits as its factorization.
100241124421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 100241124421 its reverse (124421142001), we get a palindrome (224662266422).
The spelling of 100241124421 in words is "one hundred billion, two hundred forty-one million, one hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •