Base | Representation |
---|---|
bin | 100001101111100… |
… | …0010111100101101 |
3 | 2220220110022220021 |
4 | 1003133002330231 |
5 | 4304321241023 |
6 | 304203122141 |
7 | 40025433442 |
oct | 10337027455 |
9 | 2826408807 |
10 | 1132212013 |
11 | 531116709 |
12 | 277213351 |
13 | 15074b74a |
14 | aa5259c9 |
15 | 695ea35d |
hex | 437c2f2d |
1132212013 has 2 divisors, whose sum is σ = 1132212014. Its totient is φ = 1132212012.
The previous prime is 1132211981. The next prime is 1132212061. The reversal of 1132212013 is 3102122311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 982320964 + 149891049 = 31342^2 + 12243^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132212013 - 25 = 1132211981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132212313) 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, 566106006 + 566106007.
It is an arithmetic number, because the mean of its divisors is an integer number (566106007).
Almost surely, 21132212013 is an apocalyptic number.
It is an amenable number.
1132212013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132212013 is an equidigital number, since it uses as much as digits as its factorization.
1132212013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1132212013 is about 33648.3582511837. The cubic root of 1132212013 is about 1042.2596372245.
Adding to 1132212013 its reverse (3102122311), we get a palindrome (4234334324).
The spelling of 1132212013 in words is "one billion, one hundred thirty-two million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •