Base | Representation |
---|---|
bin | 11101010010011001100… |
… | …011111011000010110111 |
3 | 21010101221000112101002121 |
4 | 131102121203323002313 |
5 | 230433321440303323 |
6 | 4140330233220411 |
7 | 265256424310456 |
oct | 35223143730267 |
9 | 7111830471077 |
10 | 2012621025463 |
11 | 706603111044 |
12 | 286086861707 |
13 | 117a35276889 |
14 | 6d5a8b68b9d |
15 | 37546020a5d |
hex | 1d4998fb0b7 |
2012621025463 has 4 divisors (see below), whose sum is σ = 2015492097528. Its totient is φ = 2009749953400.
The previous prime is 2012621025449. The next prime is 2012621025491. The reversal of 2012621025463 is 3645201262102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012621025463 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012621025433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1435534981 + ... + 1435536382.
It is an arithmetic number, because the mean of its divisors is an integer number (503873024382).
Almost surely, 22012621025463 is an apocalyptic number.
2012621025463 is a deficient number, since it is larger than the sum of its proper divisors (2871072065).
2012621025463 is an equidigital number, since it uses as much as digits as its factorization.
2012621025463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2871072064.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 2012621025463 its reverse (3645201262102), we get a palindrome (5657822287565).
The spelling of 2012621025463 in words is "two trillion, twelve billion, six hundred twenty-one million, twenty-five thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •