Base | Representation |
---|---|
bin | 10110001000110101101… |
… | …111110010001110010001 |
3 | 12101102210102020112221211 |
4 | 112020311233302032101 |
5 | 144411130424013323 |
6 | 3122515042220121 |
7 | 214624505562061 |
oct | 26106557621621 |
9 | 5342712215854 |
10 | 1521320141713 |
11 | 537208617419 |
12 | 206a13054641 |
13 | b05c945bc88 |
14 | 538bcdd73a1 |
15 | 2988de8370d |
hex | 16235bf2391 |
1521320141713 has 2 divisors, whose sum is σ = 1521320141714. Its totient is φ = 1521320141712.
The previous prime is 1521320141651. The next prime is 1521320141723. The reversal of 1521320141713 is 3171410231251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1389963187089 + 131356954624 = 1178967^2 + 362432^2 .
It is a cyclic number.
It is not a de Polignac number, because 1521320141713 - 225 = 1521286587281 is a prime.
It is not a weakly prime, because it can be changed into another prime (1521320141723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 760660070856 + 760660070857.
It is an arithmetic number, because the mean of its divisors is an integer number (760660070857).
Almost surely, 21521320141713 is an apocalyptic number.
It is an amenable number.
1521320141713 is a deficient number, since it is larger than the sum of its proper divisors (1).
1521320141713 is an equidigital number, since it uses as much as digits as its factorization.
1521320141713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 31.
Adding to 1521320141713 its reverse (3171410231251), we get a palindrome (4692730372964).
The spelling of 1521320141713 in words is "one trillion, five hundred twenty-one billion, three hundred twenty million, one hundred forty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •