Base | Representation |
---|---|
bin | 10000011000000000101… |
… | …110101110011001010101 |
3 | 10222120120122120212001121 |
4 | 100120000232232121111 |
5 | 121414100140231323 |
6 | 2220541444523541 |
7 | 144204553314313 |
oct | 20300056563125 |
9 | 3876518525047 |
10 | 1125293680213 |
11 | 3a4263a4533a |
12 | 16210a6b05b1 |
13 | 82165108b61 |
14 | 3c67085b0b3 |
15 | 1e411334a5d |
hex | 10600bae655 |
1125293680213 has 2 divisors, whose sum is σ = 1125293680214. Its totient is φ = 1125293680212.
The previous prime is 1125293680207. The next prime is 1125293680297. The reversal of 1125293680213 is 3120863925211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1062140482404 + 63153197809 = 1030602^2 + 251303^2 .
It is a cyclic number.
It is not a de Polignac number, because 1125293680213 - 233 = 1116703745621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1125293680213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1125293680513) 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, 562646840106 + 562646840107.
It is an arithmetic number, because the mean of its divisors is an integer number (562646840107).
Almost surely, 21125293680213 is an apocalyptic number.
It is an amenable number.
1125293680213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1125293680213 is an equidigital number, since it uses as much as digits as its factorization.
1125293680213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 1125293680213 in words is "one trillion, one hundred twenty-five billion, two hundred ninety-three million, six hundred eighty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •