Base | Representation |
---|---|
bin | 1010111100000000000110… |
… | …0110101101001110010001 |
3 | 1120120200001010000112022202 |
4 | 2233000001212231032101 |
5 | 3034013103422241341 |
6 | 41324345522412545 |
7 | 2350562613613523 |
oct | 257000146551621 |
9 | 46520033015282 |
10 | 12025935352721 |
11 | 3917196a9a204 |
12 | 1422859501155 |
13 | 69306b949c44 |
14 | 2d80b6285a13 |
15 | 15cc4eca479b |
hex | af0019ad391 |
12025935352721 has 2 divisors, whose sum is σ = 12025935352722. Its totient is φ = 12025935352720.
The previous prime is 12025935352633. The next prime is 12025935352751. The reversal of 12025935352721 is 12725353952021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11892228117121 + 133707235600 = 3448511^2 + 365660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12025935352721 is a prime.
It is a super-2 number, since 2×120259353527212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12025935352751) 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, 6012967676360 + 6012967676361.
It is an arithmetic number, because the mean of its divisors is an integer number (6012967676361).
Almost surely, 212025935352721 is an apocalyptic number.
It is an amenable number.
12025935352721 is a deficient number, since it is larger than the sum of its proper divisors (1).
12025935352721 is an equidigital number, since it uses as much as digits as its factorization.
12025935352721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134000, while the sum is 47.
The spelling of 12025935352721 in words is "twelve trillion, twenty-five billion, nine hundred thirty-five million, three hundred fifty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •