Base | Representation |
---|---|
bin | 1011011000000000101111… |
… | …0111001110011010000111 |
3 | 1122021200010100121001201121 |
4 | 2312000023313032122013 |
5 | 3114404112302323023 |
6 | 42333411425334411 |
7 | 2430416453064511 |
oct | 266001367163207 |
9 | 48250110531647 |
10 | 12507143792263 |
11 | 3a9228267914a |
12 | 149bb75197407 |
13 | 6c955987aa73 |
14 | 3134c58acbb1 |
15 | 16a515cc2d5d |
hex | b600bdce687 |
12507143792263 has 2 divisors, whose sum is σ = 12507143792264. Its totient is φ = 12507143792262.
The previous prime is 12507143792239. The next prime is 12507143792279. The reversal of 12507143792263 is 36229734170521.
12507143792263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12507143792263 - 241 = 10308120536711 is a prime.
It is a super-2 number, since 2×125071437922632 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12507143792263.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12507143798263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6253571896131 + 6253571896132.
It is an arithmetic number, because the mean of its divisors is an integer number (6253571896132).
Almost surely, 212507143792263 is an apocalyptic number.
12507143792263 is a deficient number, since it is larger than the sum of its proper divisors (1).
12507143792263 is an equidigital number, since it uses as much as digits as its factorization.
12507143792263 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3810240, while the sum is 52.
The spelling of 12507143792263 in words is "twelve trillion, five hundred seven billion, one hundred forty-three million, seven hundred ninety-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •