Base | Representation |
---|---|
bin | 10110011100101101… |
… | …10001010100111101 |
3 | 1011002220222120001220 |
4 | 23032112301110331 |
5 | 144140303312201 |
6 | 5311524223553 |
7 | 604442253162 |
oct | 131626612475 |
9 | 34086876056 |
10 | 12052010301 |
11 | 51250557a1 |
12 | 240423abb9 |
13 | 11a0b74c56 |
14 | 8248ba069 |
15 | 4a80e6036 |
hex | 2ce5b153d |
12052010301 has 4 divisors (see below), whose sum is σ = 16069347072. Its totient is φ = 8034673532.
The previous prime is 12052010273. The next prime is 12052010309. The reversal of 12052010301 is 10301025021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12052010301 - 26 = 12052010237 is a prime.
It is a super-2 number, since 2×120520103012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12052010309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2008668381 + ... + 2008668386.
It is an arithmetic number, because the mean of its divisors is an integer number (4017336768).
Almost surely, 212052010301 is an apocalyptic number.
It is an amenable number.
12052010301 is a deficient number, since it is larger than the sum of its proper divisors (4017336771).
12052010301 is an equidigital number, since it uses as much as digits as its factorization.
12052010301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4017336770.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 12052010301 its reverse (10301025021), we get a palindrome (22353035322).
The spelling of 12052010301 in words is "twelve billion, fifty-two million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •