Base | Representation |
---|---|
bin | 110110110110000101011100… |
… | …001001001000110110110111 |
3 | 1011122001120021112222000200220 |
4 | 312312011130021020312313 |
5 | 223104001021234210403 |
6 | 2213002521503305423 |
7 | 101543635334321061 |
oct | 6666053411106667 |
9 | 1148046245860626 |
10 | 241211204210103 |
11 | 6a948108460386 |
12 | 230784202ab273 |
13 | a47917146835a |
14 | 437c982694731 |
15 | 1cd46cc422953 |
hex | db615c248db7 |
241211204210103 has 8 divisors (see below), whose sum is σ = 321615038548608. Its totient is φ = 160807419672504.
The previous prime is 241211204210089. The next prime is 241211204210131. The reversal of 241211204210103 is 301012402112142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 241211204210103 - 213 = 241211204201911 is a prime.
It is a super-2 number, since 2×2412112042101032 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241211204210183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 894726 + ... + 21982332.
It is an arithmetic number, because the mean of its divisors is an integer number (40201879818576).
Almost surely, 2241211204210103 is an apocalyptic number.
241211204210103 is a deficient number, since it is larger than the sum of its proper divisors (80403834338505).
241211204210103 is a wasteful number, since it uses less digits than its factorization.
241211204210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24900453.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 241211204210103 its reverse (301012402112142), we get a palindrome (542223606322245).
The spelling of 241211204210103 in words is "two hundred forty-one trillion, two hundred eleven billion, two hundred four million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •