Base | Representation |
---|---|
bin | 1000001101000011… |
… | …00010001111100001 |
3 | 102100221200210120222 |
4 | 10012201202033201 |
5 | 33010012442401 |
6 | 2005014012425 |
7 | 214100652206 |
oct | 40641421741 |
9 | 12327623528 |
10 | 4404421601 |
11 | 19601aa158 |
12 | a2b047115 |
13 | 552650738 |
14 | 2dad49cad |
15 | 1aba0dc1b |
hex | 1068623e1 |
4404421601 has 12 divisors (see below), whose sum is σ = 4455606636. Its totient is φ = 4353730560.
The previous prime is 4404421583. The next prime is 4404421607. The reversal of 4404421601 is 1061244044.
It can be written as a sum of positive squares in 6 ways, for example, as 968703376 + 3435718225 = 31124^2 + 58615^2 .
It is not a de Polignac number, because 4404421601 - 26 = 4404421537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4404421607) 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 11 ways as a sum of consecutive naturals, for example, 7633025 + ... + 7633601.
It is an arithmetic number, because the mean of its divisors is an integer number (371300553).
Almost surely, 24404421601 is an apocalyptic number.
It is an amenable number.
4404421601 is a deficient number, since it is larger than the sum of its proper divisors (51185035).
4404421601 is an equidigital number, since it uses as much as digits as its factorization.
4404421601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172 (or 991 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 26.
The square root of 4404421601 is about 66365.8165097063. The cubic root of 4404421601 is about 1639.1912531600.
Adding to 4404421601 its reverse (1061244044), we get a palindrome (5465665645).
The spelling of 4404421601 in words is "four billion, four hundred four million, four hundred twenty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •