Base | Representation |
---|---|
bin | 1011110110100100011110… |
… | …0010100110110011001101 |
3 | 1201010212012121200222112211 |
4 | 2331221013202212303031 |
5 | 3202004301020431341 |
6 | 43414513420030421 |
7 | 2513353233013342 |
oct | 275510742466315 |
9 | 51125177628484 |
10 | 13032131030221 |
11 | 4174994246326 |
12 | 156586a392411 |
13 | 736c036b4234 |
14 | 330a894b67c9 |
15 | 178ee0407181 |
hex | bda478a6ccd |
13032131030221 has 2 divisors, whose sum is σ = 13032131030222. Its totient is φ = 13032131030220.
The previous prime is 13032131030153. The next prime is 13032131030231. The reversal of 13032131030221 is 12203013123031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8605504388196 + 4426626642025 = 2933514^2 + 2103955^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032131030221 - 215 = 13032130997453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13032131030192 and 13032131030201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032131030231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516065515110 + 6516065515111.
It is an arithmetic number, because the mean of its divisors is an integer number (6516065515111).
Almost surely, 213032131030221 is an apocalyptic number.
It is an amenable number.
13032131030221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032131030221 is an equidigital number, since it uses as much as digits as its factorization.
13032131030221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13032131030221 its reverse (12203013123031), we get a palindrome (25235144153252).
The spelling of 13032131030221 in words is "thirteen trillion, thirty-two billion, one hundred thirty-one million, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •