Base | Representation |
---|---|
bin | 10011010000010101011… |
… | …110000100001100100101 |
3 | 11200111102210022020021111 |
4 | 103100111132010030211 |
5 | 133134413243131323 |
6 | 2451512505145021 |
7 | 164412244346446 |
oct | 23202536041445 |
9 | 4614383266244 |
10 | 1323210130213 |
11 | 470196693594 |
12 | 19454448b171 |
13 | 97a168797ba |
14 | 48087d352cd |
15 | 246468e0c0d |
hex | 13415784325 |
1323210130213 has 2 divisors, whose sum is σ = 1323210130214. Its totient is φ = 1323210130212.
The previous prime is 1323210130183. The next prime is 1323210130241. The reversal of 1323210130213 is 3120310123231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 863827112929 + 459383017284 = 929423^2 + 677778^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323210130213 - 29 = 1323210129701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323210130013) 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, 661605065106 + 661605065107.
It is an arithmetic number, because the mean of its divisors is an integer number (661605065107).
Almost surely, 21323210130213 is an apocalyptic number.
It is an amenable number.
1323210130213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323210130213 is an equidigital number, since it uses as much as digits as its factorization.
1323210130213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1323210130213 its reverse (3120310123231), we get a palindrome (4443520253444).
The spelling of 1323210130213 in words is "one trillion, three hundred twenty-three billion, two hundred ten million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •