Base | Representation |
---|---|
bin | 110110110100011111000010… |
… | …000000010000111010011111 |
3 | 1011121200001110020110002201101 |
4 | 312310133002000100322133 |
5 | 223100200321431311033 |
6 | 2212440214334453531 |
7 | 101532663405123526 |
oct | 6664370200207237 |
9 | 1147601406402641 |
10 | 241101244010143 |
11 | 6a905510824670 |
12 | 2305b0529642a7 |
13 | a46b999294c8a |
14 | 43775108b14bd |
15 | 1cd18e3a8c97d |
hex | db47c2010e9f |
241101244010143 has 16 divisors (see below), whose sum is σ = 266026900596480. Its totient is φ = 216677778926400.
The previous prime is 241101244010117. The next prime is 241101244010177. The reversal of 241101244010143 is 341010442101142.
It is a happy number.
It is not a de Polignac number, because 241101244010143 - 217 = 241101243879071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241101244013143) 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 in 15 ways as a sum of consecutive naturals, for example, 19111563 + ... + 29111068.
It is an arithmetic number, because the mean of its divisors is an integer number (16626681287280).
Almost surely, 2241101244010143 is an apocalyptic number.
241101244010143 is a deficient number, since it is larger than the sum of its proper divisors (24925656586337).
241101244010143 is a wasteful number, since it uses less digits than its factorization.
241101244010143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48227838.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 241101244010143 its reverse (341010442101142), we get a palindrome (582111686111285).
The spelling of 241101244010143 in words is "two hundred forty-one trillion, one hundred one billion, two hundred forty-four million, ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •