Base | Representation |
---|---|
bin | 11110111001000011001… |
… | …00111011001111110001 |
3 | 10202110201012110102002201 |
4 | 33130201210323033301 |
5 | 114342242041000342 |
6 | 2131335411343201 |
7 | 136453661156404 |
oct | 17344144731761 |
9 | 3673635412081 |
10 | 1061420250097 |
11 | 37a167072969 |
12 | 1518635b1b01 |
13 | 791260446ac |
14 | 3953179dd3b |
15 | 1c923a0ddb7 |
hex | f72193b3f1 |
1061420250097 has 2 divisors, whose sum is σ = 1061420250098. Its totient is φ = 1061420250096.
The previous prime is 1061420250043. The next prime is 1061420250131. The reversal of 1061420250097 is 7900520241601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 963948912481 + 97471337616 = 981809^2 + 312204^2 .
It is a cyclic number.
It is not a de Polignac number, because 1061420250097 - 27 = 1061420249969 is a prime.
It is a super-2 number, since 2×10614202500972 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1061420650097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530710125048 + 530710125049.
It is an arithmetic number, because the mean of its divisors is an integer number (530710125049).
Almost surely, 21061420250097 is an apocalyptic number.
It is an amenable number.
1061420250097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061420250097 is an equidigital number, since it uses as much as digits as its factorization.
1061420250097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 37.
Adding to 1061420250097 its reverse (7900520241601), we get a palindrome (8961940491698).
The spelling of 1061420250097 in words is "one trillion, sixty-one billion, four hundred twenty million, two hundred fifty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •