Base | Representation |
---|---|
bin | 10010111110111011101… |
… | …100001100010110011001 |
3 | 11121201012112002020010022 |
4 | 102332323230030112121 |
5 | 132333131121440001 |
6 | 2435142353000225 |
7 | 163151215112444 |
oct | 22767354142631 |
9 | 4551175066108 |
10 | 1304524015001 |
11 | 463277885669 |
12 | 1909aa553075 |
13 | 9602945b9ac |
14 | 471d434665b |
15 | 23e011a911b |
hex | 12fbbb0c599 |
1304524015001 has 2 divisors, whose sum is σ = 1304524015002. Its totient is φ = 1304524015000.
The previous prime is 1304524014973. The next prime is 1304524015019. The reversal of 1304524015001 is 1005104254031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 824899897600 + 479624117401 = 908240^2 + 692549^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1304524015001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1304524015061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 652262007500 + 652262007501.
It is an arithmetic number, because the mean of its divisors is an integer number (652262007501).
Almost surely, 21304524015001 is an apocalyptic number.
It is an amenable number.
1304524015001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1304524015001 is an equidigital number, since it uses as much as digits as its factorization.
1304524015001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 1304524015001 its reverse (1005104254031), we get a palindrome (2309628269032).
The spelling of 1304524015001 in words is "one trillion, three hundred four billion, five hundred twenty-four million, fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •