Base | Representation |
---|---|
bin | 10100110010100000… |
… | …00100001011001010 |
3 | 1001210211111121002011 |
4 | 22121100010023022 |
5 | 140324212410132 |
6 | 5043300130134 |
7 | 543403305436 |
oct | 123120041312 |
9 | 31724447064 |
10 | 11161060042 |
11 | 4808144670 |
12 | 21b599694a |
13 | 108b3c9752 |
14 | 77c4379c6 |
15 | 454ca5b47 |
hex | 2994042ca |
11161060042 has 8 divisors (see below), whose sum is σ = 18263552832. Its totient is φ = 5073209100.
The previous prime is 11161060033. The next prime is 11161060051. The reversal of 11161060042 is 24006016111.
It is an interprime number because it is at equal distance from previous prime (11161060033) and next prime (11161060051).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111610600422 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 507320911 = 11161060042 / (1 + 1 + 1 + 6 + 1 + 0 + 6 + 0 + 0 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11161059995 and 11161060022.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 253660434 + ... + 253660477.
It is an arithmetic number, because the mean of its divisors is an integer number (2282944104).
Almost surely, 211161060042 is an apocalyptic number.
11161060042 is a deficient number, since it is larger than the sum of its proper divisors (7102492790).
11161060042 is a wasteful number, since it uses less digits than its factorization.
11161060042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507320924.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11161060042 its reverse (24006016111), we get a palindrome (35167076153).
The spelling of 11161060042 in words is "eleven billion, one hundred sixty-one million, sixty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •