Base | Representation |
---|---|
bin | 110110110110101101100000… |
… | …001010101111101011101100 |
3 | 1011122012200022111102100121112 |
4 | 312312231200022233223230 |
5 | 223110202121140204400 |
6 | 2213034354223251152 |
7 | 101550020336444060 |
oct | 6666554012575354 |
9 | 1148180274370545 |
10 | 241254221413100 |
11 | 6a964382559715 |
12 | 23084826749ab8 |
13 | a48023864641c |
14 | 4380aa3865aa0 |
15 | 1cd5898c4a835 |
hex | db6b602afaec |
241254221413100 has 72 divisors (see below), whose sum is σ = 600923178975840. Its totient is φ = 82354528926720.
The previous prime is 241254221413043. The next prime is 241254221413103. The reversal of 241254221413100 is 1314122452142.
It is a super-2 number, since 2×2412542214131002 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (241254221413103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 752348189 + ... + 752668788.
Almost surely, 2241254221413100 is an apocalyptic number.
241254221413100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
241254221413100 is an abundant number, since it is smaller than the sum of its proper divisors (359668957562740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241254221413100 is a wasteful number, since it uses less digits than its factorization.
241254221413100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1505017227 (or 1505017220 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 241254221413100 its reverse (1314122452142), we get a palindrome (242568343865242).
The spelling of 241254221413100 in words is "two hundred forty-one trillion, two hundred fifty-four billion, two hundred twenty-one million, four hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •