Base | Representation |
---|---|
bin | 100011110001000… |
… | …0011101010000101 |
3 | 10002122012220201102 |
4 | 1013202003222011 |
5 | 4424212011323 |
6 | 315030305445 |
7 | 41511524411 |
oct | 10742035205 |
9 | 3078186642 |
10 | 1200110213 |
11 | 566481625 |
12 | 295ab8285 |
13 | 1618326b3 |
14 | b555bd41 |
15 | 7055d328 |
hex | 47883a85 |
1200110213 has 2 divisors, whose sum is σ = 1200110214. Its totient is φ = 1200110212.
The previous prime is 1200110203. The next prime is 1200110227. The reversal of 1200110213 is 3120110021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 649128484 + 550981729 = 25478^2 + 23473^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1200110213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1200110194 and 1200110203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200110203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600055106 + 600055107.
It is an arithmetic number, because the mean of its divisors is an integer number (600055107).
Almost surely, 21200110213 is an apocalyptic number.
It is an amenable number.
1200110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200110213 is an equidigital number, since it uses as much as digits as its factorization.
1200110213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1200110213 is about 34642.6069024835. The cubic root of 1200110213 is about 1062.6911011836.
Adding to 1200110213 its reverse (3120110021), we get a palindrome (4320220234).
The spelling of 1200110213 in words is "one billion, two hundred million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •