Base | Representation |
---|---|
bin | 1010100110110… |
… | …0110111000001 |
3 | 10002201010102122 |
4 | 2221230313001 |
5 | 42342023311 |
6 | 4225254025 |
7 | 1050061013 |
oct | 251546701 |
9 | 102633378 |
10 | 44486081 |
11 | 23125062 |
12 | 12a94315 |
13 | 92a7733 |
14 | 5ca01b3 |
15 | 3d8b0db |
hex | 2a6cdc1 |
44486081 has 2 divisors, whose sum is σ = 44486082. Its totient is φ = 44486080.
The previous prime is 44486077. The next prime is 44486083. The reversal of 44486081 is 18068444.
44486081 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., 33825856 + 10660225 = 5816^2 + 3265^2 .
It is a cyclic number.
It is not a de Polignac number, because 44486081 - 22 = 44486077 is a prime.
It is a super-2 number, since 2×444860812 = 3958022805477122, which contains 22 as substring.
Together with 44486083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (44486083) 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, 22243040 + 22243041.
It is an arithmetic number, because the mean of its divisors is an integer number (22243041).
Almost surely, 244486081 is an apocalyptic number.
It is an amenable number.
44486081 is a deficient number, since it is larger than the sum of its proper divisors (1).
44486081 is an equidigital number, since it uses as much as digits as its factorization.
44486081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 35.
The square root of 44486081 is about 6669.7886773120. The cubic root of 44486081 is about 354.3301021434.
The spelling of 44486081 in words is "forty-four million, four hundred eighty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •