Base | Representation |
---|---|
bin | 100001101011010… |
… | …0110111101010101 |
3 | 2220202021221212202 |
4 | 1003112212331111 |
5 | 4303240001323 |
6 | 304043454245 |
7 | 40000562156 |
oct | 10326467525 |
9 | 2822257782 |
10 | 1130000213 |
11 | 52a945981 |
12 | 276527385 |
13 | 150155aa4 |
14 | aa10b92d |
15 | 6930ed28 |
hex | 435a6f55 |
1130000213 has 2 divisors, whose sum is σ = 1130000214. Its totient is φ = 1130000212.
The previous prime is 1130000191. The next prime is 1130000219. The reversal of 1130000213 is 3120000311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 685549489 + 444450724 = 26183^2 + 21082^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130000213 - 212 = 1129996117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1130000194 and 1130000203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130000219) 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, 565000106 + 565000107.
It is an arithmetic number, because the mean of its divisors is an integer number (565000107).
Almost surely, 21130000213 is an apocalyptic number.
It is an amenable number.
1130000213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130000213 is an equidigital number, since it uses as much as digits as its factorization.
1130000213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 1130000213 is about 33615.4757961270. The cubic root of 1130000213 is about 1041.5805027510.
Adding to 1130000213 its reverse (3120000311), we get a palindrome (4250000524).
The spelling of 1130000213 in words is "one billion, one hundred thirty million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •