Base | Representation |
---|---|
bin | 10000001011000100110… |
… | …111011000010010111101 |
3 | 10221020201200111000212200 |
4 | 100023010313120102331 |
5 | 121202124012223031 |
6 | 2210323325422113 |
7 | 143203431435240 |
oct | 20130467302275 |
9 | 3836650430780 |
10 | 1111404414141 |
11 | 3993868aa14a |
12 | 15b49310a939 |
13 | 80a6072b418 |
14 | 3bb13d6b257 |
15 | 1dd9bcc68e6 |
hex | 102c4dd84bd |
1111404414141 has 24 divisors (see below), whose sum is σ = 1837110335424. Its totient is φ = 634253664960.
The previous prime is 1111404414079. The next prime is 1111404414151. The reversal of 1111404414141 is 1414144041111.
1111404414141 is a `hidden beast` number, since 1 + 1 + 1 + 140 + 441 + 41 + 41 = 666.
It is not a de Polignac number, because 1111404414141 - 210 = 1111404413117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111404414151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11542951 + ... + 11638836.
It is an arithmetic number, because the mean of its divisors is an integer number (76546263976).
Almost surely, 21111404414141 is an apocalyptic number.
It is an amenable number.
1111404414141 is a deficient number, since it is larger than the sum of its proper divisors (725705921283).
1111404414141 is a wasteful number, since it uses less digits than its factorization.
1111404414141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23182561 (or 23182558 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 27.
Adding to 1111404414141 its reverse (1414144041111), we get a palindrome (2525548455252).
The spelling of 1111404414141 in words is "one trillion, one hundred eleven billion, four hundred four million, four hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •