Base | Representation |
---|---|
bin | 1011100001000111001110… |
… | …1111100111100001100111 |
3 | 1122211121201110122022221112 |
4 | 2320101303233213201213 |
5 | 3124434324343413421 |
6 | 42533311210335235 |
7 | 2444623320210224 |
oct | 270216357474147 |
9 | 48747643568845 |
10 | 12663505451111 |
11 | 4042620765799 |
12 | 150633242a51b |
13 | 70b218101aa8 |
14 | 31acba0d294b |
15 | 16e61812845b |
hex | b8473be7867 |
12663505451111 has 4 divisors (see below), whose sum is σ = 12734251291800. Its totient is φ = 12592759610424.
The previous prime is 12663505451101. The next prime is 12663505451117. The reversal of 12663505451111 is 11115450536621.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12663505451111 - 222 = 12663501256807 is a prime.
It is a super-2 number, since 2×126635054511112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12663505451117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35372920076 + ... + 35372920433.
It is an arithmetic number, because the mean of its divisors is an integer number (3183562822950).
Almost surely, 212663505451111 is an apocalyptic number.
12663505451111 is a deficient number, since it is larger than the sum of its proper divisors (70745840689).
12663505451111 is an equidigital number, since it uses as much as digits as its factorization.
12663505451111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70745840688.
The product of its (nonzero) digits is 108000, while the sum is 41.
Adding to 12663505451111 its reverse (11115450536621), we get a palindrome (23778955987732).
The spelling of 12663505451111 in words is "twelve trillion, six hundred sixty-three billion, five hundred five million, four hundred fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •