Base | Representation |
---|---|
bin | 1011110101111100001100… |
… | …1101100111010101101101 |
3 | 1201002211022020201120021022 |
4 | 2331133003031213111231 |
5 | 3201320131134002201 |
6 | 43405525015343525 |
7 | 2512521321202205 |
oct | 275370315472555 |
9 | 51084266646238 |
10 | 13021321000301 |
11 | 417034726a8a9 |
12 | 1563752081ba5 |
13 | 735b9cc41823 |
14 | 330341937405 |
15 | 178aab39041b |
hex | bd7c336756d |
13021321000301 has 2 divisors, whose sum is σ = 13021321000302. Its totient is φ = 13021321000300.
The previous prime is 13021321000279. The next prime is 13021321000307. The reversal of 13021321000301 is 10300012312031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12962347306276 + 58973694025 = 3600326^2 + 242845^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021321000301 - 222 = 13021316805997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13021321000301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13021321000307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510660500150 + 6510660500151.
It is an arithmetic number, because the mean of its divisors is an integer number (6510660500151).
Almost surely, 213021321000301 is an apocalyptic number.
It is an amenable number.
13021321000301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021321000301 is an equidigital number, since it uses as much as digits as its factorization.
13021321000301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13021321000301 its reverse (10300012312031), we get a palindrome (23321333312332).
The spelling of 13021321000301 in words is "thirteen trillion, twenty-one billion, three hundred twenty-one million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •