Base | Representation |
---|---|
bin | 1011100001011111111001… |
… | …0011101011110100101001 |
3 | 1122212020210210201210212201 |
4 | 2320113332103223310221 |
5 | 3130041404013112001 |
6 | 42540324121140201 |
7 | 2445246340432534 |
oct | 270277623536451 |
9 | 48766723653781 |
10 | 12670125129001 |
11 | 404540836476a |
12 | 150767b32a661 |
13 | 70ba31696062 |
14 | 31b34732ba1b |
15 | 16e8a4369501 |
hex | b85fe4ebd29 |
12670125129001 has 2 divisors, whose sum is σ = 12670125129002. Its totient is φ = 12670125129000.
The previous prime is 12670125128957. The next prime is 12670125129091. The reversal of 12670125129001 is 10092152107621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10769653341225 + 1900471787776 = 3281715^2 + 1378576^2 .
It is an emirp because it is prime and its reverse (10092152107621) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12670125129001 is a prime.
It is a super-3 number, since 3×126701251290013 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (12670125129091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6335062564500 + 6335062564501.
It is an arithmetic number, because the mean of its divisors is an integer number (6335062564501).
Almost surely, 212670125129001 is an apocalyptic number.
It is an amenable number.
12670125129001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12670125129001 is an equidigital number, since it uses as much as digits as its factorization.
12670125129001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15120, while the sum is 37.
The spelling of 12670125129001 in words is "twelve trillion, six hundred seventy billion, one hundred twenty-five million, one hundred twenty-nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •