Base | Representation |
---|---|
bin | 100110111000001… |
… | …0001100010111101 |
3 | 10100220122111011010 |
4 | 1031300101202331 |
5 | 10132423003123 |
6 | 333235545433 |
7 | 44220033126 |
oct | 11560214275 |
9 | 3326574133 |
10 | 1304500413 |
11 | 60a3a1517 |
12 | 304a5b279 |
13 | 17a352548 |
14 | c537304d |
15 | 797cd993 |
hex | 4dc118bd |
1304500413 has 4 divisors (see below), whose sum is σ = 1739333888. Its totient is φ = 869666940.
The previous prime is 1304500411. The next prime is 1304500427. The reversal of 1304500413 is 3140054031.
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 not a de Polignac number, because 1304500413 - 21 = 1304500411 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 1304500413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304500411) 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, 217416733 + ... + 217416738.
It is an arithmetic number, because the mean of its divisors is an integer number (434833472).
Almost surely, 21304500413 is an apocalyptic number.
It is an amenable number.
1304500413 is a deficient number, since it is larger than the sum of its proper divisors (434833475).
1304500413 is an equidigital number, since it uses as much as digits as its factorization.
1304500413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434833474.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1304500413 is about 36117.8683341085. The cubic root of 1304500413 is about 1092.6508476013.
Adding to 1304500413 its reverse (3140054031), we get a palindrome (4444554444).
The spelling of 1304500413 in words is "one billion, three hundred four million, five hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •