Base | Representation |
---|---|
bin | 10010001110110110000… |
… | …110000110100010000101 |
3 | 11102202221002120201122202 |
4 | 102032312012012202011 |
5 | 131011404434123234 |
6 | 2355323040204245 |
7 | 156342536561444 |
oct | 22166606064205 |
9 | 4382832521582 |
10 | 1252890536069 |
11 | 443391054727 |
12 | 18299a609685 |
13 | 911bb1638b3 |
14 | 448d6ac8d5b |
15 | 228cd20077e |
hex | 123b6186885 |
1252890536069 has 2 divisors, whose sum is σ = 1252890536070. Its totient is φ = 1252890536068.
The previous prime is 1252890535991. The next prime is 1252890536099. The reversal of 1252890536069 is 9606350982521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1185518104225 + 67372431844 = 1088815^2 + 259562^2 .
It is a cyclic number.
It is not a de Polignac number, because 1252890536069 - 212 = 1252890531973 is a prime.
It is a super-2 number, since 2×12528905360692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1252890536099) 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, 626445268034 + 626445268035.
It is an arithmetic number, because the mean of its divisors is an integer number (626445268035).
Almost surely, 21252890536069 is an apocalyptic number.
It is an amenable number.
1252890536069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1252890536069 is an equidigital number, since it uses as much as digits as its factorization.
1252890536069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6998400, while the sum is 56.
The spelling of 1252890536069 in words is "one trillion, two hundred fifty-two billion, eight hundred ninety million, five hundred thirty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •