Base | Representation |
---|---|
bin | 1010011000001101101111… |
… | …1100000101111011100100 |
3 | 1111101220002210022010221012 |
4 | 2212003123330011323210 |
5 | 2443424440003221122 |
6 | 40134110402241352 |
7 | 2255266160656406 |
oct | 246033374057344 |
9 | 44356083263835 |
10 | 11411123101412 |
11 | 36aa48055a001 |
12 | 1343676056258 |
13 | 64a0ab32b4b8 |
14 | 2b6430ad0b76 |
15 | 14bc6985b7e2 |
hex | a60dbf05ee4 |
11411123101412 has 24 divisors (see below), whose sum is σ = 20223670292280. Its totient is φ = 5633120979200.
The previous prime is 11411123101331. The next prime is 11411123101453. The reversal of 11411123101412 is 21410132111411.
It can be written as a sum of positive squares in 4 ways, for example, as 2884582940836 + 8526540160576 = 1698406^2 + 2920024^2 .
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 7 ways as a sum of consecutive naturals, for example, 23432339 + ... + 23914362.
It is an arithmetic number, because the mean of its divisors is an integer number (842652928845).
Almost surely, 211411123101412 is an apocalyptic number.
It is an amenable number.
11411123101412 is a deficient number, since it is larger than the sum of its proper divisors (8812547190868).
11411123101412 is a wasteful number, since it uses less digits than its factorization.
11411123101412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47347471 (or 47347469 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 11411123101412 its reverse (21410132111411), we get a palindrome (32821255212823).
Subtracting 11411123101412 from its reverse (21410132111411), we obtain a palindrome (9999009009999).
The spelling of 11411123101412 in words is "eleven trillion, four hundred eleven billion, one hundred twenty-three million, one hundred one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •