Base | Representation |
---|---|
bin | 110110110100101010001101… |
… | …000101111101010001101100 |
3 | 1011121201012102100022002202100 |
4 | 312310222031011331101230 |
5 | 223100344404222241022 |
6 | 2212445521024255100 |
7 | 101533566613504461 |
oct | 6664521505752154 |
9 | 1147635370262670 |
10 | 241113241212012 |
11 | 6a90a607944a34 |
12 | 23061440771490 |
13 | a46cb5b989cb0 |
14 | 4377d2bda1668 |
15 | 1cd1d96e591ac |
hex | db4a8d17d46c |
241113241212012 has 144 divisors (see below), whose sum is σ = 667810733073120. Its totient is φ = 72905075426304.
The previous prime is 241113241211959. The next prime is 241113241212013. The reversal of 241113241212012 is 210212142311142.
241113241212012 is a `hidden beast` number, since 2 + 4 + 1 + 11 + 32 + 412 + 1 + 201 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (241113241212013) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10967643 + ... + 24546194.
It is an arithmetic number, because the mean of its divisors is an integer number (4637574535230).
Almost surely, 2241113241212012 is an apocalyptic number.
It is an amenable number.
241113241212012 is an abundant number, since it is smaller than the sum of its proper divisors (426697491861108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241113241212012 is a wasteful number, since it uses less digits than its factorization.
241113241212012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35514112 (or 35514107 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 241113241212012 its reverse (210212142311142), we get a palindrome (451325383523154).
The spelling of 241113241212012 in words is "two hundred forty-one trillion, one hundred thirteen billion, two hundred forty-one million, two hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •