Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …101111101010011000011 |
3 | 10221012222012022121100101 |
4 | 100022303111331103003 |
5 | 121201023233041011 |
6 | 2210234224503231 |
7 | 143163231624166 |
oct | 20126325752303 |
9 | 3835865277311 |
10 | 1111110440131 |
11 | 39924597111a |
12 | 15b41077ab17 |
13 | 80a148603c3 |
14 | 3bac6cc5add |
15 | 1dd810a82c1 |
hex | 102b357d4c3 |
1111110440131 has 16 divisors (see below), whose sum is σ = 1191730436640. Its totient is φ = 1032706920960.
The previous prime is 1111110440059. The next prime is 1111110440137. The reversal of 1111110440131 is 1310440111111.
It is a happy number.
It is not a de Polignac number, because 1111110440131 - 29 = 1111110439619 is a prime.
It is a super-2 number, since 2×11111104401312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1111110440099 and 1111110440108.
It is not an unprimeable number, because it can be changed into a prime (1111110440137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28257921 + ... + 28297213.
It is an arithmetic number, because the mean of its divisors is an integer number (74483152290).
Almost surely, 21111110440131 is an apocalyptic number.
1111110440131 is a deficient number, since it is larger than the sum of its proper divisors (80619996509).
1111110440131 is a wasteful number, since it uses less digits than its factorization.
1111110440131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67446.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 1111110440131 its reverse (1310440111111), we get a palindrome (2421550551242).
The spelling of 1111110440131 in words is "one trillion, one hundred eleven billion, one hundred ten million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •