Base | Representation |
---|---|
bin | 10000010111000001111… |
… | …111111101000101011101 |
3 | 10222110212022012221211100 |
4 | 100113001333331011131 |
5 | 121404421223412341 |
6 | 2220245211143313 |
7 | 144136513541652 |
oct | 20270177750535 |
9 | 3873768187740 |
10 | 1124241232221 |
11 | 3a3873959608 |
12 | 161a76144b39 |
13 | 82028067273 |
14 | 3c5b0b79c29 |
15 | 1e39dc433b6 |
hex | 105c1ffd15d |
1124241232221 has 48 divisors (see below), whose sum is σ = 1652613318720. Its totient is φ = 736355854080.
The previous prime is 1124241232217. The next prime is 1124241232229. The reversal of 1124241232221 is 1222321424211.
1124241232221 is a `hidden beast` number, since 1 + 1 + 2 + 424 + 1 + 232 + 2 + 2 + 1 = 666.
It is not a de Polignac number, because 1124241232221 - 22 = 1124241232217 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124241232229) 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 47 ways as a sum of consecutive naturals, for example, 101122555 + ... + 101133671.
It is an arithmetic number, because the mean of its divisors is an integer number (34429444140).
Almost surely, 21124241232221 is an apocalyptic number.
It is an amenable number.
1124241232221 is a deficient number, since it is larger than the sum of its proper divisors (528372086499).
1124241232221 is a wasteful number, since it uses less digits than its factorization.
1124241232221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11946 (or 11943 counting only the distinct ones).
The product of its digits is 3072, while the sum is 27.
Adding to 1124241232221 its reverse (1222321424211), we get a palindrome (2346562656432).
The spelling of 1124241232221 in words is "one trillion, one hundred twenty-four billion, two hundred forty-one million, two hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •