Base | Representation |
---|---|
bin | 100111000110011… |
… | …1001000001001001 |
3 | 10101102202121120011 |
4 | 1032030321001021 |
5 | 10141333031441 |
6 | 334104431521 |
7 | 44340556033 |
oct | 11614710111 |
9 | 3342677504 |
10 | 1312002121 |
11 | 613655681 |
12 | 3074785a1 |
13 | 17ba7ac21 |
14 | c6366c53 |
15 | 7a2b1581 |
hex | 4e339049 |
1312002121 has 4 divisors (see below), whose sum is σ = 1336756932. Its totient is φ = 1287247312.
The previous prime is 1312002077. The next prime is 1312002151. The reversal of 1312002121 is 1212002131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 813105225 + 498896896 = 28515^2 + 22336^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312002121 - 27 = 1312001993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312002151) 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 in 3 ways as a sum of consecutive naturals, for example, 12377326 + ... + 12377431.
It is an arithmetic number, because the mean of its divisors is an integer number (334189233).
Almost surely, 21312002121 is an apocalyptic number.
It is an amenable number.
1312002121 is a deficient number, since it is larger than the sum of its proper divisors (24754811).
1312002121 is an equidigital number, since it uses as much as digits as its factorization.
1312002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24754810.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1312002121 is about 36221.5698306962. The cubic root of 1312002121 is about 1094.7413248844.
Adding to 1312002121 its reverse (1212002131), we get a palindrome (2524004252).
The spelling of 1312002121 in words is "one billion, three hundred twelve million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •