Base | Representation |
---|---|
bin | 100110110111101… |
… | …0000100001110111 |
3 | 10100220010221211210 |
4 | 1031233100201313 |
5 | 10132340442403 |
6 | 333230132503 |
7 | 44214543534 |
oct | 11557204167 |
9 | 3326127753 |
10 | 1304234103 |
11 | 60a22a427 |
12 | 304951133 |
13 | 17a28b273 |
14 | c5303d8b |
15 | 79779b03 |
hex | 4dbd0877 |
1304234103 has 4 divisors (see below), whose sum is σ = 1738978808. Its totient is φ = 869489400.
The previous prime is 1304234047. The next prime is 1304234111. The reversal of 1304234103 is 3014324031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1304234103 - 230 = 230492279 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1304234103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304234153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217372348 + ... + 217372353.
It is an arithmetic number, because the mean of its divisors is an integer number (434744702).
Almost surely, 21304234103 is an apocalyptic number.
1304234103 is a deficient number, since it is larger than the sum of its proper divisors (434744705).
1304234103 is an equidigital number, since it uses as much as digits as its factorization.
1304234103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434744704.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 1304234103 is about 36114.1814665652. The cubic root of 1304234103 is about 1092.5764887005.
Adding to 1304234103 its reverse (3014324031), we get a palindrome (4318558134).
The spelling of 1304234103 in words is "one billion, three hundred four million, two hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •