Base | Representation |
---|---|
bin | 100111101001001… |
… | …1001000000111001 |
3 | 10102201001020022122 |
4 | 1033102121000321 |
5 | 10211014033423 |
6 | 335555131025 |
7 | 44651456444 |
oct | 11722310071 |
9 | 3381036278 |
10 | 1330221113 |
11 | 6229698a1 |
12 | 3115a3a75 |
13 | 1827897b0 |
14 | c894a65b |
15 | 7bbae8c8 |
hex | 4f499039 |
1330221113 has 8 divisors (see below), whose sum is σ = 1433005056. Its totient is φ = 1227502800.
The previous prime is 1330221089. The next prime is 1330221127. The reversal of 1330221113 is 3111220331.
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 1330221113 - 216 = 1330155577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330221091 and 1330221100.
It is not an unprimeable number, because it can be changed into a prime (1330221173) 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, 30728 + ... + 60038.
It is an arithmetic number, because the mean of its divisors is an integer number (179125632).
Almost surely, 21330221113 is an apocalyptic number.
1330221113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1330221113 is a deficient number, since it is larger than the sum of its proper divisors (102783943).
1330221113 is a wasteful number, since it uses less digits than its factorization.
1330221113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32815.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1330221113 is about 36472.1964378347. The cubic root of 1330221113 is about 1099.7853887103.
Adding to 1330221113 its reverse (3111220331), we get a palindrome (4441441444).
The spelling of 1330221113 in words is "one billion, three hundred thirty million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •