Base | Representation |
---|---|
bin | 110000011101111… |
… | …000111111000101 |
3 | 2002200001220001210 |
4 | 300131320333011 |
5 | 3131131020312 |
6 | 212404242033 |
7 | 26102410155 |
oct | 6035707705 |
9 | 2080056053 |
10 | 813141957 |
11 | 387aa7651 |
12 | 1a83a0319 |
13 | cc6048b4 |
14 | 79dca765 |
15 | 4b5c0e3c |
hex | 30778fc5 |
813141957 has 16 divisors (see below), whose sum is σ = 1092728000. Its totient is φ = 537840000.
The previous prime is 813141941. The next prime is 813141983. The reversal of 813141957 is 759141318.
It is not a de Polignac number, because 813141957 - 24 = 813141941 is a prime.
It is a super-2 number, since 2×8131419572 = 1322399684467579698, which contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (813141907) 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 in 15 ways as a sum of consecutive naturals, for example, 269457 + ... + 272457.
It is an arithmetic number, because the mean of its divisors is an integer number (68295500).
Almost surely, 2813141957 is an apocalyptic number.
It is an amenable number.
813141957 is a deficient number, since it is larger than the sum of its proper divisors (279586043).
813141957 is a wasteful number, since it uses less digits than its factorization.
813141957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3684.
The product of its digits is 30240, while the sum is 39.
The square root of 813141957 is about 28515.6440747881. The cubic root of 813141957 is about 933.3734795515.
The spelling of 813141957 in words is "eight hundred thirteen million, one hundred forty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •