Base | Representation |
---|---|
bin | 1000010001011101… |
… | …01001100110011111 |
3 | 102110112022012200120 |
4 | 10020232221212133 |
5 | 33044000222142 |
6 | 2012414530023 |
7 | 215030253000 |
oct | 41056514637 |
9 | 12415265616 |
10 | 4441414047 |
11 | 197a076124 |
12 | a3b506913 |
13 | 55a203365 |
14 | 301c191a7 |
15 | 1aedb97ec |
hex | 108ba999f |
4441414047 has 32 divisors (see below), whose sum is σ = 6920524800. Its totient is φ = 2532610080.
The previous prime is 4441414039. The next prime is 4441414063. The reversal of 4441414047 is 7404141444.
4441414047 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4441414047 - 23 = 4441414039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4441413999 and 4441414017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4441414007) 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 31 ways as a sum of consecutive naturals, for example, 513297 + ... + 521877.
It is an arithmetic number, because the mean of its divisors is an integer number (216266400).
Almost surely, 24441414047 is an apocalyptic number.
4441414047 is a deficient number, since it is larger than the sum of its proper divisors (2479110753).
4441414047 is an equidigital number, since it uses as much as digits as its factorization.
4441414047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9108 (or 9094 counting only the distinct ones).
The product of its (nonzero) digits is 28672, while the sum is 33.
The square root of 4441414047 is about 66643.9348103036. The cubic root of 4441414047 is about 1643.7676177865.
The spelling of 4441414047 in words is "four billion, four hundred forty-one million, four hundred fourteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •