Base | Representation |
---|---|
bin | 1011110110011101010100… |
… | …0011001110111001010101 |
3 | 1201010200020202022212021002 |
4 | 2331213111003032321111 |
5 | 3201441332303000341 |
6 | 43413555042033045 |
7 | 2513254520161541 |
oct | 275472503167125 |
9 | 51120222285232 |
10 | 13030210203221 |
11 | 4174098a655a2 |
12 | 1565413048785 |
13 | 73698876aa03 |
14 | 33094634aa21 |
15 | 178e2b98329b |
hex | bd9d50cee55 |
13030210203221 has 2 divisors, whose sum is σ = 13030210203222. Its totient is φ = 13030210203220.
The previous prime is 13030210203181. The next prime is 13030210203229. The reversal of 13030210203221 is 12230201203031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11198653980721 + 1831556222500 = 3346439^2 + 1353350^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13030210203221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13030210203193 and 13030210203202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13030210203229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515105101610 + 6515105101611.
It is an arithmetic number, because the mean of its divisors is an integer number (6515105101611).
Almost surely, 213030210203221 is an apocalyptic number.
It is an amenable number.
13030210203221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13030210203221 is an equidigital number, since it uses as much as digits as its factorization.
13030210203221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13030210203221 its reverse (12230201203031), we get a palindrome (25260411406252).
The spelling of 13030210203221 in words is "thirteen trillion, thirty billion, two hundred ten million, two hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •