Base | Representation |
---|---|
bin | 10011000100000011111… |
… | …000010010100110111011 |
3 | 11122020102020202222220122 |
4 | 103010003320102212323 |
5 | 132430420202110321 |
6 | 2441453003443455 |
7 | 163434524143061 |
oct | 23040370224673 |
9 | 4566366688818 |
10 | 1310030113211 |
11 | 465642934756 |
12 | 191a8652658b |
13 | 966c60c9281 |
14 | 4759770a031 |
15 | 241247808ab |
hex | 13103e129bb |
1310030113211 has 2 divisors, whose sum is σ = 1310030113212. Its totient is φ = 1310030113210.
The previous prime is 1310030113193. The next prime is 1310030113243. The reversal of 1310030113211 is 1123110300131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1310030113211 - 226 = 1309963004347 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1310030113211.
It is not a weakly prime, because it can be changed into another prime (1310030113261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655015056605 + 655015056606.
It is an arithmetic number, because the mean of its divisors is an integer number (655015056606).
Almost surely, 21310030113211 is an apocalyptic number.
1310030113211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310030113211 is an equidigital number, since it uses as much as digits as its factorization.
1310030113211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1310030113211 its reverse (1123110300131), we get a palindrome (2433140413342).
It can be divided in two parts, 1310030 and 113211, that added together give a palindrome (1423241).
The spelling of 1310030113211 in words is "one trillion, three hundred ten billion, thirty million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •