Base | Representation |
---|---|
bin | 1010100000000… |
… | …1111101100111 |
3 | 10001212212210222 |
4 | 2220001331213 |
5 | 42234020411 |
6 | 4212034555 |
7 | 1043255333 |
oct | 250017547 |
9 | 101785728 |
10 | 44048231 |
11 | 229560a7 |
12 | 12902a5b |
13 | 9183356 |
14 | 5bc87c3 |
15 | 3d014db |
hex | 2a01f67 |
44048231 has 2 divisors, whose sum is σ = 44048232. Its totient is φ = 44048230.
The previous prime is 44048209. The next prime is 44048233. The reversal of 44048231 is 13284044.
44048231 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-44048231 is a prime.
It is a super-2 number, since 2×440482312 = 3880493308458722, which contains 22 as substring.
Together with 44048233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 44048231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44048233) 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, 22024115 + 22024116.
It is an arithmetic number, because the mean of its divisors is an integer number (22024116).
Almost surely, 244048231 is an apocalyptic number.
44048231 is a deficient number, since it is larger than the sum of its proper divisors (1).
44048231 is an equidigital number, since it uses as much as digits as its factorization.
44048231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 26.
The square root of 44048231 is about 6636.8841333867. The cubic root of 44048231 is about 353.1637805427.
The spelling of 44048231 in words is "forty-four million, forty-eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •