Base | Representation |
---|---|
bin | 1100011001100111101… |
… | …0000011100001010001 |
3 | 202100212210221020101201 |
4 | 3012121322003201101 |
5 | 11442244043432241 |
6 | 241511150431201 |
7 | 21251135062405 |
oct | 3063172034121 |
9 | 670783836351 |
10 | 213035530321 |
11 | 82391004059 |
12 | 35355202501 |
13 | 17120b81123 |
14 | a44d459105 |
15 | 581ca93931 |
hex | 3199e83851 |
213035530321 has 2 divisors, whose sum is σ = 213035530322. Its totient is φ = 213035530320.
The previous prime is 213035530273. The next prime is 213035530339. The reversal of 213035530321 is 123035530312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 207535824721 + 5499705600 = 455561^2 + 74160^2 .
It is a cyclic number.
It is not a de Polignac number, because 213035530321 - 213 = 213035522129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213035530321.
It is not a weakly prime, because it can be changed into another prime (213035530361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106517765160 + 106517765161.
It is an arithmetic number, because the mean of its divisors is an integer number (106517765161).
Almost surely, 2213035530321 is an apocalyptic number.
It is an amenable number.
213035530321 is a deficient number, since it is larger than the sum of its proper divisors (1).
213035530321 is an equidigital number, since it uses as much as digits as its factorization.
213035530321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 28.
Subtracting from 213035530321 its reverse (123035530312), we obtain a palindrome (90000000009).
The spelling of 213035530321 in words is "two hundred thirteen billion, thirty-five million, five hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •