Base | Representation |
---|---|
bin | 1011100100000000010010… |
… | …0111001011010110101111 |
3 | 1200000100221102011002112102 |
4 | 2321000010213023112233 |
5 | 3131243043211401101 |
6 | 43012204324525315 |
7 | 2451332315615600 |
oct | 271000447132657 |
9 | 50010842132472 |
10 | 12713180575151 |
11 | 40616a2003711 |
12 | 1513a9655083b |
13 | 712b03774104 |
14 | 31d46d615da7 |
15 | 170a741e886b |
hex | b90049cb5af |
12713180575151 has 12 divisors (see below), whose sum is σ = 14815352736648. Its totient is φ = 10877448142512.
The previous prime is 12713180575141. The next prime is 12713180575189. The reversal of 12713180575151 is 15157508131721.
It is not a de Polignac number, because 12713180575151 - 218 = 12713180313007 is a prime.
It is a super-2 number, since 2×127131805751512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12713180575096 and 12713180575105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12713180575141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 232874561 + ... + 232929146.
It is an arithmetic number, because the mean of its divisors is an integer number (1234612728054).
Almost surely, 212713180575151 is an apocalyptic number.
12713180575151 is a deficient number, since it is larger than the sum of its proper divisors (2102172161497).
12713180575151 is an equidigital number, since it uses as much as digits as its factorization.
12713180575151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465804278 (or 465804271 counting only the distinct ones).
The product of its (nonzero) digits is 294000, while the sum is 47.
The spelling of 12713180575151 in words is "twelve trillion, seven hundred thirteen billion, one hundred eighty million, five hundred seventy-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •