Base | Representation |
---|---|
bin | 1000001010000110… |
… | …10110010100100000 |
3 | 102022020020101202212 |
4 | 10011003112110200 |
5 | 32432202344412 |
6 | 2002332501252 |
7 | 213351046502 |
oct | 40503262440 |
9 | 12266211685 |
10 | 4379731232 |
11 | 1948275998 |
12 | a2291a828 |
13 | 54a4b7456 |
14 | 2d795dd72 |
15 | 1a9783222 |
hex | 1050d6520 |
4379731232 has 18 divisors (see below), whose sum is σ = 8623332963. Its totient is φ = 2189678432.
The previous prime is 4379731171. The next prime is 4379731261. The reversal of 4379731232 is 2321379734.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 2189865616 + 2189865616 = 46796^2 + 46796^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=46796.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4379731232.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 368519 + ... + 380217.
Almost surely, 24379731232 is an apocalyptic number.
It is an amenable number.
4379731232 is a deficient number, since it is larger than the sum of its proper divisors (4243601731).
4379731232 is an frugal number, since it uses more digits than its factorization.
4379731232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23408 (or 11701 counting only the distinct ones).
The product of its digits is 190512, while the sum is 41.
The square root of 4379731232 is about 66179.5378648114. The cubic root of 4379731232 is about 1636.1225112154.
The spelling of 4379731232 in words is "four billion, three hundred seventy-nine million, seven hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •