Base | Representation |
---|---|
bin | 100110110111011… |
… | …0100111100001111 |
3 | 10100212221012211121 |
4 | 1031232310330033 |
5 | 10132323333403 |
6 | 333223501411 |
7 | 44213563225 |
oct | 11556647417 |
9 | 3325835747 |
10 | 1304121103 |
11 | 60a16253a |
12 | 3048b7867 |
13 | 17a24b9bc |
14 | c52b4b15 |
15 | 797563bd |
hex | 4dbb4f0f |
1304121103 has 4 divisors (see below), whose sum is σ = 1304193400. Its totient is φ = 1304048808.
The previous prime is 1304121101. The next prime is 1304121121. The reversal of 1304121103 is 3011214031.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1304121103 - 21 = 1304121101 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 (1304121101) 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, 15676 + ... + 53422.
It is an arithmetic number, because the mean of its divisors is an integer number (326048350).
Almost surely, 21304121103 is an apocalyptic number.
1304121103 is a deficient number, since it is larger than the sum of its proper divisors (72297).
1304121103 is an equidigital number, since it uses as much as digits as its factorization.
1304121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72296.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1304121103 is about 36112.6169503125. The cubic root of 1304121103 is about 1092.5449338570.
Adding to 1304121103 its reverse (3011214031), we get a palindrome (4315335134).
The spelling of 1304121103 in words is "one billion, three hundred four million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •