Base | Representation |
---|---|
bin | 100000110110000… |
… | …1100001101110101 |
3 | 2211210210122122221 |
4 | 1001230030031311 |
5 | 4224114302123 |
6 | 301205522341 |
7 | 36211503325 |
oct | 10154141565 |
9 | 2753718587 |
10 | 1102103413 |
11 | 516121674 |
12 | 2691133b1 |
13 | 1474391c8 |
14 | a6529285 |
15 | 66b4e25d |
hex | 41b0c375 |
1102103413 has 4 divisors (see below), whose sum is σ = 1137655168. Its totient is φ = 1066551660.
The previous prime is 1102103407. The next prime is 1102103441. The reversal of 1102103413 is 3143012011.
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: 3143012011 = 1171 ⋅2684041.
It is a cyclic number.
It is not a de Polignac number, because 1102103413 - 213 = 1102095221 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 (1102103713) 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, 17775831 + ... + 17775892.
It is an arithmetic number, because the mean of its divisors is an integer number (284413792).
Almost surely, 21102103413 is an apocalyptic number.
It is an amenable number.
1102103413 is a deficient number, since it is larger than the sum of its proper divisors (35551755).
1102103413 is an equidigital number, since it uses as much as digits as its factorization.
1102103413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35551754.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1102103413 is about 33197.9429031378. The cubic root of 1102103413 is about 1032.9376696665.
Adding to 1102103413 its reverse (3143012011), we get a palindrome (4245115424).
The spelling of 1102103413 in words is "one billion, one hundred two million, one hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •