Base | Representation |
---|---|
bin | 1010100011101… |
… | …0111010001001 |
3 | 10002022201202212 |
4 | 2220322322021 |
5 | 42314001411 |
6 | 4221034505 |
7 | 1045246346 |
oct | 250727211 |
9 | 102281685 |
10 | 44281481 |
11 | 22aa5372 |
12 | 129b5a35 |
13 | 923557a |
14 | 5c497cd |
15 | 3d4a68b |
hex | 2a3ae89 |
44281481 has 8 divisors (see below), whose sum is σ = 46970784. Its totient is φ = 41601600.
The previous prime is 44281477. The next prime is 44281483. The reversal of 44281481 is 18418244.
44281481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 44281481 - 22 = 44281477 is a prime.
It is a super-2 number, since 2×442814812 = 3921699119106722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (44281483) 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 in 7 ways as a sum of consecutive naturals, for example, 8906 + ... + 12956.
It is an arithmetic number, because the mean of its divisors is an integer number (5871348).
Almost surely, 244281481 is an apocalyptic number.
It is an amenable number.
44281481 is a deficient number, since it is larger than the sum of its proper divisors (2689303).
44281481 is a wasteful number, since it uses less digits than its factorization.
44281481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4711.
The product of its digits is 8192, while the sum is 32.
The square root of 44281481 is about 6654.4331839759. The cubic root of 44281481 is about 353.7860565827.
The spelling of 44281481 in words is "forty-four million, two hundred eighty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •