Base | Representation |
---|---|
bin | 1011110101111011110000… |
… | …0001001100010011010001 |
3 | 1201002210222211121112010111 |
4 | 2331132330001030103101 |
5 | 3201314404234201223 |
6 | 43405505024401321 |
7 | 2512515324246016 |
oct | 275367401142321 |
9 | 51083884545114 |
10 | 13021200303313 |
11 | 4170295122424 |
12 | 1563719776241 |
13 | 735b80c325a7 |
14 | 33032d8b970d |
15 | 178aa099d30d |
hex | bd7bc04c4d1 |
13021200303313 has 2 divisors, whose sum is σ = 13021200303314. Its totient is φ = 13021200303312.
The previous prime is 13021200303301. The next prime is 13021200303359. The reversal of 13021200303313 is 31330300212031.
13021200303313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11495029146624 + 1526171156689 = 3390432^2 + 1235383^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021200303313 - 217 = 13021200172241 is a prime.
It is not a weakly prime, because it can be changed into another prime (13021200303373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510600151656 + 6510600151657.
It is an arithmetic number, because the mean of its divisors is an integer number (6510600151657).
Almost surely, 213021200303313 is an apocalyptic number.
It is an amenable number.
13021200303313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021200303313 is an equidigital number, since it uses as much as digits as its factorization.
13021200303313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13021200303313 its reverse (31330300212031), we get a palindrome (44351500515344).
The spelling of 13021200303313 in words is "thirteen trillion, twenty-one billion, two hundred million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •