Base | Representation |
---|---|
bin | 100110111000111… |
… | …0101000100011111 |
3 | 10100221102012100021 |
4 | 1031301311010133 |
5 | 10133024024223 |
6 | 333252413011 |
7 | 44223351454 |
oct | 11561650437 |
9 | 3327365307 |
10 | 1304908063 |
11 | 60a64a818 |
12 | 305017167 |
13 | 17a465c64 |
14 | c543b82b |
15 | 7985e65d |
hex | 4dc7511f |
1304908063 has 2 divisors, whose sum is σ = 1304908064. Its totient is φ = 1304908062.
The previous prime is 1304908061. The next prime is 1304908091. The reversal of 1304908063 is 3608094031.
It is a weak prime.
It is an emirp because it is prime and its reverse (3608094031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1304908063 - 21 = 1304908061 is a prime.
Together with 1304908061, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1304908061) 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 as a sum of consecutive naturals, namely, 652454031 + 652454032.
It is an arithmetic number, because the mean of its divisors is an integer number (652454032).
Almost surely, 21304908063 is an apocalyptic number.
1304908063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304908063 is an equidigital number, since it uses as much as digits as its factorization.
1304908063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 1304908063 is about 36123.5112219175. The cubic root of 1304908063 is about 1092.7646517633.
The spelling of 1304908063 in words is "one billion, three hundred four million, nine hundred eight thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •