Base | Representation |
---|---|
bin | 100100001001101… |
… | …0001010010000101 |
3 | 10010112111100101012 |
4 | 1020103101102011 |
5 | 4441012323302 |
6 | 320211012005 |
7 | 42026265305 |
oct | 11023212205 |
9 | 3115440335 |
10 | 1213011077 |
11 | 5727931a3 |
12 | 29a29a005 |
13 | 1643cb745 |
14 | b7159605 |
15 | 7175aa52 |
hex | 484d1485 |
1213011077 has 2 divisors, whose sum is σ = 1213011078. Its totient is φ = 1213011076.
The previous prime is 1213011001. The next prime is 1213011083. The reversal of 1213011077 is 7701103121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1212850276 + 160801 = 34826^2 + 401^2 .
It is an emirp because it is prime and its reverse (7701103121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1213011077 - 212 = 1213006981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1213011097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606505538 + 606505539.
It is an arithmetic number, because the mean of its divisors is an integer number (606505539).
Almost surely, 21213011077 is an apocalyptic number.
It is an amenable number.
1213011077 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213011077 is an equidigital number, since it uses as much as digits as its factorization.
1213011077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 294, while the sum is 23.
The square root of 1213011077 is about 34828.3085578384. The cubic root of 1213011077 is about 1066.4854192802.
Adding to 1213011077 its reverse (7701103121), we get a palindrome (8914114198).
The spelling of 1213011077 in words is "one billion, two hundred thirteen million, eleven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •