Base | Representation |
---|---|
bin | 100110110111010… |
… | …0111001111100101 |
3 | 10100212211100212121 |
4 | 1031232213033211 |
5 | 10132320034442 |
6 | 333222345541 |
7 | 44213240524 |
oct | 11556471745 |
9 | 3325740777 |
10 | 1304064997 |
11 | 60a124374 |
12 | 30488b2b1 |
13 | 17a22c2c1 |
14 | c529c4bb |
15 | 79744967 |
hex | 4dba73e5 |
1304064997 has 2 divisors, whose sum is σ = 1304064998. Its totient is φ = 1304064996.
The previous prime is 1304064989. The next prime is 1304065027. The reversal of 1304064997 is 7994604031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1148464321 + 155600676 = 33889^2 + 12474^2 .
It is an emirp because it is prime and its reverse (7994604031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1304064997 - 23 = 1304064989 is a prime.
It is a super-2 number, since 2×13040649972 = 3401171032801220018, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1304064967) 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, 652032498 + 652032499.
It is an arithmetic number, because the mean of its divisors is an integer number (652032499).
Almost surely, 21304064997 is an apocalyptic number.
It is an amenable number.
1304064997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304064997 is an equidigital number, since it uses as much as digits as its factorization.
1304064997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 43.
The square root of 1304064997 is about 36111.8401220431. The cubic root of 1304064997 is about 1092.5292657811.
The spelling of 1304064997 in words is "one billion, three hundred four million, sixty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •