Base | Representation |
---|---|
bin | 100000111000001… |
… | …1011001010011101 |
3 | 2211212220001000122 |
4 | 1001300123022131 |
5 | 4224410310323 |
6 | 301245404325 |
7 | 36224105024 |
oct | 10160331235 |
9 | 2755801018 |
10 | 1103213213 |
11 | 51680a463 |
12 | 2695696a5 |
13 | 1477373ab |
14 | a67378bb |
15 | 66cbcec8 |
hex | 41c1b29d |
1103213213 has 4 divisors (see below), whose sum is σ = 1138800768. Its totient is φ = 1067625660.
The previous prime is 1103213197. The next prime is 1103213219. The reversal of 1103213213 is 3123123011.
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 1103213213 - 24 = 1103213197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103213191 and 1103213200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103213219) 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, 17793731 + ... + 17793792.
It is an arithmetic number, because the mean of its divisors is an integer number (284700192).
Almost surely, 21103213213 is an apocalyptic number.
It is an amenable number.
1103213213 is a deficient number, since it is larger than the sum of its proper divisors (35587555).
1103213213 is an equidigital number, since it uses as much as digits as its factorization.
1103213213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35587554.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1103213213 is about 33214.6535884389. The cubic root of 1103213213 is about 1033.2842704304.
Adding to 1103213213 its reverse (3123123011), we get a palindrome (4226336224).
The spelling of 1103213213 in words is "one billion, one hundred three million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •