Base | Representation |
---|---|
bin | 10100111010111000… |
… | …01000001010111001 |
3 | 1001222201201201201021 |
4 | 22131130020022321 |
5 | 141000210043001 |
6 | 5054250222441 |
7 | 545215511152 |
oct | 123534101271 |
9 | 31881651637 |
10 | 11231331001 |
11 | 4843880240 |
12 | 2215424a21 |
13 | 109cb316b7 |
14 | 7878ca929 |
15 | 45b036ba1 |
hex | 29d7082b9 |
11231331001 has 4 divisors (see below), whose sum is σ = 12252361104. Its totient is φ = 10210300900.
The previous prime is 11231330987. The next prime is 11231331029. The reversal of 11231331001 is 10013313211.
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 11231331001 - 29 = 11231330489 is a prime.
It is a super-2 number, since 2×112313310012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11231334001) 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, 510515035 + ... + 510515056.
It is an arithmetic number, because the mean of its divisors is an integer number (3063090276).
Almost surely, 211231331001 is an apocalyptic number.
11231331001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11231331001 is a deficient number, since it is larger than the sum of its proper divisors (1021030103).
11231331001 is a wasteful number, since it uses less digits than its factorization.
11231331001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1021030102.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11231331001 its reverse (10013313211), we get a palindrome (21244644212).
The spelling of 11231331001 in words is "eleven billion, two hundred thirty-one million, three hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •