Base | Representation |
---|---|
bin | 10101000100011001… |
… | …11000010101001001 |
3 | 1002012022001111212121 |
4 | 22202030320111021 |
5 | 141131133020131 |
6 | 5110222411241 |
7 | 550205532622 |
oct | 124214702511 |
9 | 32168044777 |
10 | 11311220041 |
11 | 4884986040 |
12 | 2238130b21 |
13 | 10b3553414 |
14 | 794364a49 |
15 | 463067911 |
hex | 2a2338549 |
11311220041 has 4 divisors (see below), whose sum is σ = 12339512784. Its totient is φ = 10282927300.
The previous prime is 11311220033. The next prime is 11311220083. The reversal of 11311220041 is 14002211311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11311220041 - 23 = 11311220033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11311219997 and 11311220024.
It is not an unprimeable number, because it can be changed into a prime (11311223041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 514146355 + ... + 514146376.
It is an arithmetic number, because the mean of its divisors is an integer number (3084878196).
Almost surely, 211311220041 is an apocalyptic number.
11311220041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11311220041 is a deficient number, since it is larger than the sum of its proper divisors (1028292743).
11311220041 is a wasteful number, since it uses less digits than its factorization.
11311220041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1028292742.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11311220041 its reverse (14002211311), we get a palindrome (25313431352).
The spelling of 11311220041 in words is "eleven billion, three hundred eleven million, two hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •