Base | Representation |
---|---|
bin | 10100100000110111… |
… | …10000111011111111 |
3 | 1001102112011001222221 |
4 | 22100123300323333 |
5 | 140023330211111 |
6 | 5020453350211 |
7 | 536626035436 |
oct | 122033607377 |
9 | 31375131887 |
10 | 11013132031 |
11 | 4741698110 |
12 | 2174338367 |
13 | 1066874995 |
14 | 76692c11d |
15 | 446cd5371 |
hex | 2906f0eff |
11013132031 has 8 divisors (see below), whose sum is σ = 12015590400. Its totient is φ = 10010884440.
The previous prime is 11013131989. The next prime is 11013132043. The reversal of 11013132031 is 13023131011.
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 11013132031 - 211 = 11013129983 is a prime.
It is a super-2 number, since 2×110131320312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11013131996 and 11013132014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013132061) 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, 68740 + ... + 163558.
It is an arithmetic number, because the mean of its divisors is an integer number (1501948800).
Almost surely, 211013132031 is an apocalyptic number.
11013132031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11013132031 is a deficient number, since it is larger than the sum of its proper divisors (1002458369).
11013132031 is a wasteful number, since it uses less digits than its factorization.
11013132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105389.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11013132031 its reverse (13023131011), we get a palindrome (24036263042).
The spelling of 11013132031 in words is "eleven billion, thirteen million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •