Base | Representation |
---|---|
bin | 1011011100110001100001… |
… | …0100011010100001001001 |
3 | 1122120111022001212012212201 |
4 | 2313030120110122201021 |
5 | 3122224141012234012 |
6 | 42435142001440201 |
7 | 2436344044124266 |
oct | 267143024324111 |
9 | 48514261765781 |
10 | 12588957149257 |
11 | 4013a46132175 |
12 | 14b39a8340061 |
13 | 70419759b488 |
14 | 3174473da26d |
15 | 16c703587857 |
hex | b731851a849 |
12588957149257 has 2 divisors, whose sum is σ = 12588957149258. Its totient is φ = 12588957149256.
The previous prime is 12588957149203. The next prime is 12588957149269. The reversal of 12588957149257 is 75294175988521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12585600569161 + 3356580096 = 3547619^2 + 57936^2 .
It is a cyclic number.
It is not a de Polignac number, because 12588957149257 - 223 = 12588948760649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12588957149257.
It is not a weakly prime, because it can be changed into another prime (12588957149297) by changing a digit.
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 as a sum of consecutive naturals, namely, 6294478574628 + 6294478574629.
It is an arithmetic number, because the mean of its divisors is an integer number (6294478574629).
Almost surely, 212588957149257 is an apocalyptic number.
It is an amenable number.
12588957149257 is a deficient number, since it is larger than the sum of its proper divisors (1).
12588957149257 is an equidigital number, since it uses as much as digits as its factorization.
12588957149257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 508032000, while the sum is 73.
The spelling of 12588957149257 in words is "twelve trillion, five hundred eighty-eight billion, nine hundred fifty-seven million, one hundred forty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •