Base | Representation |
---|---|
bin | 10111011100000110111… |
… | …01100100011110101001 |
3 | 2211222210020022002122221 |
4 | 23232003131210132221 |
5 | 101143341244414431 |
6 | 1413551311114041 |
7 | 112120452612400 |
oct | 13560335443651 |
9 | 2758706262587 |
10 | 805364451241 |
11 | 29060a267379 |
12 | 110102b12921 |
13 | 5ac3a48108c |
14 | 2ada09b6637 |
15 | 15e39239111 |
hex | bb837647a9 |
805364451241 has 9 divisors (see below), whose sum is σ = 936859832541. Its totient is φ = 690307002252.
The previous prime is 805364451187. The next prime is 805364451289. The reversal of 805364451241 is 142154463508.
The square root of 805364451241 is 897421.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 805364451241 - 211 = 805364449193 is a prime.
It is a super-2 number, since 2×8053644512412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (805364451841) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6217846 + ... + 6346048.
It is an arithmetic number, because the mean of its divisors is an integer number (104095536949).
Almost surely, 2805364451241 is an apocalyptic number.
805364451241 is the 897421-st square number.
805364451241 is the 448711-st centered octagonal number.
It is an amenable number.
805364451241 is a deficient number, since it is larger than the sum of its proper divisors (131495381300).
805364451241 is an frugal number, since it uses more digits than its factorization.
805364451241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256420 (or 128210 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 43.
The spelling of 805364451241 in words is "eight hundred five billion, three hundred sixty-four million, four hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •