Base | Representation |
---|---|
bin | 100000110111111… |
… | …1111100001101101 |
3 | 2211212200021202001 |
4 | 1001233333201231 |
5 | 4224343200023 |
6 | 301243132301 |
7 | 36223124011 |
oct | 10157774155 |
9 | 2755607661 |
10 | 1103100013 |
11 | 516742404 |
12 | 269514091 |
13 | 1476c7a02 |
14 | a6708541 |
15 | 66c996ad |
hex | 41bff86d |
1103100013 has 4 divisors (see below), whose sum is σ = 1103276448. Its totient is φ = 1102923580.
The previous prime is 1103099983. The next prime is 1103100101. The reversal of 1103100013 is 3100013011.
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 a de Polignac number, because none of the positive numbers 2k-1103100013 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 (1103103013) 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, 78481 + ... + 91462.
It is an arithmetic number, because the mean of its divisors is an integer number (275819112).
Almost surely, 21103100013 is an apocalyptic number.
It is an amenable number.
1103100013 is a deficient number, since it is larger than the sum of its proper divisors (176435).
1103100013 is an equidigital number, since it uses as much as digits as its factorization.
1103100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176434.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 1103100013 is about 33212.9494775758. The cubic root of 1103100013 is about 1033.2489276762.
Adding to 1103100013 its reverse (3100013011), we get a palindrome (4203113024).
The spelling of 1103100013 in words is "one billion, one hundred three million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •