Base | Representation |
---|---|
bin | 101110101011011010… |
… | …1100010110001010001 |
3 | 100120201222100201210021 |
4 | 1131112311202301101 |
5 | 3120243211440213 |
6 | 114014455103441 |
7 | 10146032333122 |
oct | 1352665426121 |
9 | 316658321707 |
10 | 100241124433 |
11 | 3956a55749a |
12 | 17516671b81 |
13 | 95b6765318 |
14 | 4bcd0aa049 |
15 | 291a4b8d8d |
hex | 1756d62c51 |
100241124433 has 8 divisors (see below), whose sum is σ = 101667911616. Its totient is φ = 98814752400.
The previous prime is 100241124421. The next prime is 100241124437. The reversal of 100241124433 is 334421142001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100241124433 - 29 = 100241123921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100241124398 and 100241124407.
It is not an unprimeable number, because it can be changed into a prime (100241124437) 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 in 7 ways as a sum of consecutive naturals, for example, 399823 + ... + 600283.
It is an arithmetic number, because the mean of its divisors is an integer number (12708488952).
Almost surely, 2100241124433 is an apocalyptic number.
It is an amenable number.
100241124433 is a deficient number, since it is larger than the sum of its proper divisors (1426787183).
100241124433 is an equidigital number, since it uses as much as digits as its factorization.
100241124433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207575.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 100241124433 its reverse (334421142001), we get a palindrome (434662266434).
The spelling of 100241124433 in words is "one hundred billion, two hundred forty-one million, one hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •