Base | Representation |
---|---|
bin | 101000010010110000… |
… | …101101010000100100 |
3 | 11010200011122211011112 |
4 | 220102300231100210 |
5 | 1202101143244030 |
6 | 31513030524152 |
7 | 3061063411520 |
oct | 502260552044 |
9 | 133604584145 |
10 | 43264431140 |
11 | 17391709517 |
12 | 8475206658 |
13 | 410648cc18 |
14 | 2145d68d80 |
15 | 11d33b0a95 |
hex | a12c2d424 |
43264431140 has 24 divisors (see below), whose sum is σ = 103834635072. Its totient is φ = 14833519200.
The previous prime is 43264431131. The next prime is 43264431143. The reversal of 43264431140 is 4113446234.
It is a super-2 number, since 2×432644311402 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 43264431097 and 43264431106.
It is not an unprimeable number, because it can be changed into a prime (43264431143) 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, 154515686 + ... + 154515965.
It is an arithmetic number, because the mean of its divisors is an integer number (4326443128).
Almost surely, 243264431140 is an apocalyptic number.
It is an amenable number.
43264431140 is an abundant number, since it is smaller than the sum of its proper divisors (60570203932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43264431140 is a wasteful number, since it uses less digits than its factorization.
43264431140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309031667 (or 309031665 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 43264431140 its reverse (4113446234), we get a palindrome (47377877374).
The spelling of 43264431140 in words is "forty-three billion, two hundred sixty-four million, four hundred thirty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •