Base | Representation |
---|---|
bin | 1011100001001010101001… |
… | …0001111000000101001101 |
3 | 1122211201002020021121220102 |
4 | 2320102222101320011031 |
5 | 3124443213110321420 |
6 | 42533542053100445 |
7 | 2444655100154066 |
oct | 270225221700515 |
9 | 48751066247812 |
10 | 12664420401485 |
11 | 4042a50179526 |
12 | 1506548927725 |
13 | 70b332831348 |
14 | 31ad6582156d |
15 | 16e66d609a75 |
hex | b84aa47814d |
12664420401485 has 4 divisors (see below), whose sum is σ = 15197304481788. Its totient is φ = 10131536321184.
The previous prime is 12664420401461. The next prime is 12664420401547. The reversal of 12664420401485 is 58410402446621.
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 2243132248681 + 10421288152804 = 1497709^2 + 3228202^2 .
It is a cyclic number.
It is not a de Polignac number, because 12664420401485 - 214 = 12664420385101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 1266442040144 + ... + 1266442040153.
It is an arithmetic number, because the mean of its divisors is an integer number (3799326120447).
Almost surely, 212664420401485 is an apocalyptic number.
It is an amenable number.
12664420401485 is a deficient number, since it is larger than the sum of its proper divisors (2532884080303).
12664420401485 is an equidigital number, since it uses as much as digits as its factorization.
12664420401485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2532884080302.
The product of its (nonzero) digits is 1474560, while the sum is 47.
The spelling of 12664420401485 in words is "twelve trillion, six hundred sixty-four billion, four hundred twenty million, four hundred one thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •