Base | Representation |
---|---|
bin | 10100100010010011011… |
… | …000101111110011110011 |
3 | 11222220121111012000201110 |
4 | 110202103120233303303 |
5 | 141110140313323443 |
6 | 3000150105204403 |
7 | 203646253113441 |
oct | 24422330576363 |
9 | 4886544160643 |
10 | 1411222011123 |
11 | 4a4550042351 |
12 | 1a9607490703 |
13 | a3101824442 |
14 | 4c436b8bb91 |
15 | 26a98455233 |
hex | 1489362fcf3 |
1411222011123 has 8 divisors (see below), whose sum is σ = 1882429710336. Its totient is φ = 940414493000.
The previous prime is 1411222011079. The next prime is 1411222011137. The reversal of 1411222011123 is 3211102221141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1411222011123 - 28 = 1411222010867 is a prime.
It is a super-2 number, since 2×14112220111232 (a number of 25 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 1411222011123.
It is not an unprimeable number, because it can be changed into a prime (1411222011223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100037043 + ... + 100051148.
It is an arithmetic number, because the mean of its divisors is an integer number (235303713792).
Almost surely, 21411222011123 is an apocalyptic number.
1411222011123 is a deficient number, since it is larger than the sum of its proper divisors (471207699213).
1411222011123 is a wasteful number, since it uses less digits than its factorization.
1411222011123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200090545.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 1411222011123 its reverse (3211102221141), we get a palindrome (4622324232264).
The spelling of 1411222011123 in words is "one trillion, four hundred eleven billion, two hundred twenty-two million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •