Base | Representation |
---|---|
bin | 100001000111101… |
… | …1000110110100101 |
3 | 2212110011102110021 |
4 | 1002033120312211 |
5 | 4234000031323 |
6 | 302135355141 |
7 | 36353102530 |
oct | 10217306645 |
9 | 2773142407 |
10 | 1111330213 |
11 | 520353924 |
12 | 270222ab1 |
13 | 149319b56 |
14 | a784ba17 |
15 | 6787305d |
hex | 423d8da5 |
1111330213 has 4 divisors (see below), whose sum is σ = 1270091680. Its totient is φ = 952568748.
The previous prime is 1111330211. The next prime is 1111330217. The reversal of 1111330213 is 3120331111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3120331111 = 107 ⋅29161973.
It is a cyclic number.
It is not a de Polignac number, because 1111330213 - 21 = 1111330211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111330211) 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, 79380723 + ... + 79380736.
It is an arithmetic number, because the mean of its divisors is an integer number (317522920).
Almost surely, 21111330213 is an apocalyptic number.
It is an amenable number.
1111330213 is a deficient number, since it is larger than the sum of its proper divisors (158761467).
1111330213 is an equidigital number, since it uses as much as digits as its factorization.
1111330213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158761466.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1111330213 is about 33336.6196996636. The cubic root of 1111330213 is about 1035.8122442280.
Adding to 1111330213 its reverse (3120331111), we get a palindrome (4231661324).
The spelling of 1111330213 in words is "one billion, one hundred eleven million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •