Base | Representation |
---|---|
bin | 10010001110000001110… |
… | …100101101001000001011 |
3 | 11102200122222101202002212 |
4 | 102032001310231020023 |
5 | 131003110432412311 |
6 | 2355100031415335 |
7 | 156312030446042 |
oct | 22160164551013 |
9 | 4380588352085 |
10 | 1252013560331 |
11 | 442a81018896 |
12 | 18279498454b |
13 | 910ab56c041 |
14 | 44852443559 |
15 | 2287b220c8b |
hex | 12381d2d20b |
1252013560331 has 2 divisors, whose sum is σ = 1252013560332. Its totient is φ = 1252013560330.
The previous prime is 1252013560327. The next prime is 1252013560333. The reversal of 1252013560331 is 1330653102521.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1252013560331 - 22 = 1252013560327 is a prime.
It is a super-3 number, since 3×12520135603313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 1252013560333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1252013560333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 626006780165 + 626006780166.
It is an arithmetic number, because the mean of its divisors is an integer number (626006780166).
Almost surely, 21252013560331 is an apocalyptic number.
1252013560331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1252013560331 is an equidigital number, since it uses as much as digits as its factorization.
1252013560331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 32.
Adding to 1252013560331 its reverse (1330653102521), we get a palindrome (2582666662852).
The spelling of 1252013560331 in words is "one trillion, two hundred fifty-two billion, thirteen million, five hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •