Base | Representation |
---|---|
bin | 100111101001001… |
… | …1011101100101111 |
3 | 10102201001210101222 |
4 | 1033102123230233 |
5 | 10211014411421 |
6 | 335555253555 |
7 | 44651533505 |
oct | 11722335457 |
9 | 3381053358 |
10 | 1330232111 |
11 | 62297708a |
12 | 3115aa2bb |
13 | 1827917c0 |
14 | c8950675 |
15 | 7bbb2cab |
hex | 4f49bb2f |
1330232111 has 4 divisors (see below), whose sum is σ = 1432557672. Its totient is φ = 1227906552.
The previous prime is 1330232089. The next prime is 1330232143. The reversal of 1330232111 is 1112320331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1330232111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1330232111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330232011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51162761 + ... + 51162786.
It is an arithmetic number, because the mean of its divisors is an integer number (358139418).
Almost surely, 21330232111 is an apocalyptic number.
1330232111 is a deficient number, since it is larger than the sum of its proper divisors (102325561).
1330232111 is a wasteful number, since it uses less digits than its factorization.
1330232111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102325560.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1330232111 is about 36472.3472099069. The cubic root of 1330232111 is about 1099.7884196366.
Adding to 1330232111 its reverse (1112320331), we get a palindrome (2442552442).
The spelling of 1330232111 in words is "one billion, three hundred thirty million, two hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •