Base | Representation |
---|---|
bin | 100110110111011… |
… | …1001111001100110 |
3 | 10100212222020200212 |
4 | 1031232321321212 |
5 | 10132330011124 |
6 | 333224135422 |
7 | 44214006362 |
oct | 11556717146 |
9 | 3325866625 |
10 | 1304141414 |
11 | 60a176824 |
12 | 304907572 |
13 | 17a258014 |
14 | c52bc2a2 |
15 | 7975c40e |
hex | 4dbb9e66 |
1304141414 has 4 divisors (see below), whose sum is σ = 1956212124. Its totient is φ = 652070706.
The previous prime is 1304141413. The next prime is 1304141431. The reversal of 1304141414 is 4141414031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 4141414031 = 31 ⋅133594001.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1304141414.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304141411) 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 as a sum of consecutive naturals, namely, 326035352 + ... + 326035355.
It is an arithmetic number, because the mean of its divisors is an integer number (489053031).
Almost surely, 21304141414 is an apocalyptic number.
1304141414 is a deficient number, since it is larger than the sum of its proper divisors (652070710).
1304141414 is an equidigital number, since it uses as much as digits as its factorization.
1304141414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652070709.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 1304141414 is about 36112.8981667215. The cubic root of 1304141414 is about 1092.5506057650.
Adding to 1304141414 its reverse (4141414031), we get a palindrome (5445555445).
The spelling of 1304141414 in words is "one billion, three hundred four million, one hundred forty-one thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •