Base | Representation |
---|---|
bin | 100111101011101… |
… | …0010011101110101 |
3 | 10102210110110111111 |
4 | 1033113102131311 |
5 | 10211331130023 |
6 | 340042435021 |
7 | 44665414546 |
oct | 11727223565 |
9 | 3383413444 |
10 | 1331505013 |
11 | 623666473 |
12 | 311b02a71 |
13 | 182b18cb7 |
14 | c8ba24cd |
15 | 7bd6500d |
hex | 4f5d2775 |
1331505013 has 2 divisors, whose sum is σ = 1331505014. Its totient is φ = 1331505012.
The previous prime is 1331504987. The next prime is 1331505151. The reversal of 1331505013 is 3105051331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1315005169 + 16499844 = 36263^2 + 4062^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331505013 - 25 = 1331504981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331505713) 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, 665752506 + 665752507.
It is an arithmetic number, because the mean of its divisors is an integer number (665752507).
Almost surely, 21331505013 is an apocalyptic number.
It is an amenable number.
1331505013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331505013 is an equidigital number, since it uses as much as digits as its factorization.
1331505013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 22.
The square root of 1331505013 is about 36489.7932715438. The cubic root of 1331505013 is about 1100.1391044469.
Adding to 1331505013 its reverse (3105051331), we get a palindrome (4436556344).
The spelling of 1331505013 in words is "one billion, three hundred thirty-one million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •