Base | Representation |
---|---|
bin | 1011010100001101011110… |
… | …0001111100110001101100 |
3 | 1122001102120022102020210120 |
4 | 2311003113201330301230 |
5 | 3112321342332242343 |
6 | 42243411502204540 |
7 | 2422615266012531 |
oct | 265032741746154 |
9 | 48042508366716 |
10 | 12441841290348 |
11 | 3a676120609a8 |
12 | 148b38b583750 |
13 | 6c33506c94a2 |
14 | 31028cad2d88 |
15 | 168992cb3683 |
hex | b50d787cc6c |
12441841290348 has 48 divisors (see below), whose sum is σ = 30312703975680. Its totient is φ = 3966847657024.
The previous prime is 12441841290317. The next prime is 12441841290371. The reversal of 12441841290348 is 84309214814421.
It is a happy number.
It is a super-2 number, since 2×124418412903482 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12441841290348.
It is an unprimeable number.
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, 167030136 + ... + 167104607.
It is an arithmetic number, because the mean of its divisors is an integer number (631514666160).
Almost surely, 212441841290348 is an apocalyptic number.
It is an amenable number.
12441841290348 is an abundant number, since it is smaller than the sum of its proper divisors (17870862685332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12441841290348 is a wasteful number, since it uses less digits than its factorization.
12441841290348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334134886 (or 334134884 counting only the distinct ones).
The product of its (nonzero) digits is 1769472, while the sum is 51.
The spelling of 12441841290348 in words is "twelve trillion, four hundred forty-one billion, eight hundred forty-one million, two hundred ninety thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •