Base | Representation |
---|---|
bin | 111011111110010… |
… | …0000111000001101 |
3 | 12012020121002000001 |
4 | 1313330200320031 |
5 | 13110130231023 |
6 | 531403404301 |
7 | 100603465330 |
oct | 16774407015 |
9 | 5166532001 |
10 | 2012352013 |
11 | 942a13941 |
12 | 481b23691 |
13 | 260bb0649 |
14 | 151392617 |
15 | bba026ad |
hex | 77f20e0d |
2012352013 has 8 divisors (see below), whose sum is σ = 2300574528. Its totient is φ = 1724315424.
The previous prime is 2012351981. The next prime is 2012352029. The reversal of 2012352013 is 3102532102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2012352013 - 25 = 2012351981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012352113) 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 in 7 ways as a sum of consecutive naturals, for example, 22456 + ... + 67297.
It is an arithmetic number, because the mean of its divisors is an integer number (287571816).
Almost surely, 22012352013 is an apocalyptic number.
It is an amenable number.
2012352013 is a deficient number, since it is larger than the sum of its proper divisors (288222515).
2012352013 is an equidigital number, since it uses as much as digits as its factorization.
2012352013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92963.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 2012352013 is about 44859.2466833762. The cubic root of 2012352013 is about 1262.5094886455.
Adding to 2012352013 its reverse (3102532102), we get a palindrome (5114884115).
It can be divided in two parts, 2012 and 352013, that added together give a square (354025 = 5952).
The spelling of 2012352013 in words is "two billion, twelve million, three hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •