Base | Representation |
---|---|
bin | 1010101010010… |
… | …0011101010101 |
3 | 10010010200211011 |
4 | 2222210131111 |
5 | 42421320223 |
6 | 4234212221 |
7 | 1052026654 |
oct | 252443525 |
9 | 103120734 |
10 | 44713813 |
11 | 23270171 |
12 | 12b84071 |
13 | 93572a1 |
14 | 5d1d19b |
15 | 3dd380d |
hex | 2aa4755 |
44713813 has 2 divisors, whose sum is σ = 44713814. Its totient is φ = 44713812.
The previous prime is 44713787. The next prime is 44713829. The reversal of 44713813 is 31831744.
44713813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39664804 + 5049009 = 6298^2 + 2247^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-44713813 is a prime.
It is equal to p2701948 and since 44713813 and 2701948 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44713913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22356906 + 22356907.
It is an arithmetic number, because the mean of its divisors is an integer number (22356907).
Almost surely, 244713813 is an apocalyptic number.
It is an amenable number.
44713813 is a deficient number, since it is larger than the sum of its proper divisors (1).
44713813 is an equidigital number, since it uses as much as digits as its factorization.
44713813 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8064, while the sum is 31.
The square root of 44713813 is about 6686.8387897421. The cubic root of 44713813 is about 354.9336991834.
The spelling of 44713813 in words is "forty-four million, seven hundred thirteen thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •