Base | Representation |
---|---|
bin | 100000110110011… |
… | …1100110000000101 |
3 | 2211211011202100220 |
4 | 1001230330300011 |
5 | 4224142132323 |
6 | 301214054553 |
7 | 36213262035 |
oct | 10154746005 |
9 | 2754152326 |
10 | 1102302213 |
11 | 516247a71 |
12 | 2691aa459 |
13 | 1474a883c |
14 | a657b8c5 |
15 | 66b8d0e3 |
hex | 41b3cc05 |
1102302213 has 8 divisors (see below), whose sum is σ = 1470251808. Its totient is φ = 734610384.
The previous prime is 1102302211. The next prime is 1102302217. The reversal of 1102302213 is 3122032011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102302213 - 21 = 1102302211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102302192 and 1102302201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102302211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54231 + ... + 71732.
It is an arithmetic number, because the mean of its divisors is an integer number (183781476).
Almost surely, 21102302213 is an apocalyptic number.
It is an amenable number.
1102302213 is a deficient number, since it is larger than the sum of its proper divisors (367949595).
1102302213 is a wasteful number, since it uses less digits than its factorization.
1102302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128883.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1102302213 is about 33200.9369295506. The cubic root of 1102302213 is about 1032.9997738395. Note that the first 3 decimals are identical.
Adding to 1102302213 its reverse (3122032011), we get a palindrome (4224334224).
The spelling of 1102302213 in words is "one billion, one hundred two million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •