Base | Representation |
---|---|
bin | 1000011010010… |
… | …10110111101101 |
3 | 11220202212212001 |
4 | 10031022313231 |
5 | 121030430021 |
6 | 11000212301 |
7 | 1514521651 |
oct | 415126755 |
9 | 156685761 |
10 | 70561261 |
11 | 369147a1 |
12 | 1b76a091 |
13 | 11807134 |
14 | 952aa61 |
15 | 62dc091 |
hex | 434aded |
70561261 has 2 divisors, whose sum is σ = 70561262. Its totient is φ = 70561260.
The previous prime is 70561219. The next prime is 70561273. The reversal of 70561261 is 16216507.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35928036 + 34633225 = 5994^2 + 5885^2 .
It is an emirp because it is prime and its reverse (16216507) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70561261 - 217 = 70430189 is a prime.
It is a super-4 number, since 4×705612614 (a number of 32 digits) contains 4444 as substring.
It is a pancake number, because a pancake can be divided into 70561261 parts by 11879 straight cuts.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (70561061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35280630 + 35280631.
It is an arithmetic number, because the mean of its divisors is an integer number (35280631).
Almost surely, 270561261 is an apocalyptic number.
It is an amenable number.
70561261 is a deficient number, since it is larger than the sum of its proper divisors (1).
70561261 is an equidigital number, since it uses as much as digits as its factorization.
70561261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 70561261 is about 8400.0750591885. The cubic root of 70561261 is about 413.2270832664.
Adding to 70561261 its reverse (16216507), we get a palindrome (86777768).
The spelling of 70561261 in words is "seventy million, five hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •