Base | Representation |
---|---|
bin | 1000010000001000… |
… | …10101000110101001 |
3 | 102102202102120120110 |
4 | 10020010111012221 |
5 | 33033130220131 |
6 | 2011341044533 |
7 | 214534045650 |
oct | 41004250651 |
9 | 12382376513 |
10 | 4430320041 |
11 | 1973889024 |
12 | a37856749 |
13 | 557b1a864 |
14 | 30056c197 |
15 | 1ade27646 |
hex | 1081151a9 |
4430320041 has 32 divisors (see below), whose sum is σ = 7128898560. Its totient is φ = 2390734656.
The previous prime is 4430320039. The next prime is 4430320061. The reversal of 4430320041 is 1400230344.
4430320041 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 4430320041 - 21 = 4430320039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (4430320061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108970 + ... + 143996.
It is an arithmetic number, because the mean of its divisors is an integer number (222778080).
Almost surely, 24430320041 is an apocalyptic number.
It is an amenable number.
4430320041 is a deficient number, since it is larger than the sum of its proper divisors (2698578519).
4430320041 is a wasteful number, since it uses less digits than its factorization.
4430320041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35373.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 4430320041 is about 66560.6493432869. The cubic root of 4430320041 is about 1642.3978458832.
Adding to 4430320041 its reverse (1400230344), we get a palindrome (5830550385).
The spelling of 4430320041 in words is "four billion, four hundred thirty million, three hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •