Base | Representation |
---|---|
bin | 101000100000000000… |
… | …010111101100111000 |
3 | 11011020122210020201120 |
4 | 220200000113230320 |
5 | 1203030040002302 |
6 | 31551045345240 |
7 | 3066432230526 |
oct | 504000275470 |
9 | 134218706646 |
10 | 43486640952 |
11 | 17496090a97 |
12 | 8517708220 |
13 | 4140522411 |
14 | 216768d316 |
15 | 11e7b559bc |
hex | a20017b38 |
43486640952 has 64 divisors (see below), whose sum is σ = 109319258880. Its totient is φ = 14415351552.
The previous prime is 43486640929. The next prime is 43486640959. The reversal of 43486640952 is 25904668434.
It is a junction number, because it is equal to n+sod(n) for n = 43486640895 and 43486640904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43486640959) 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 15 ways as a sum of consecutive naturals, for example, 4933333 + ... + 4942139.
It is an arithmetic number, because the mean of its divisors is an integer number (1708113420).
Almost surely, 243486640952 is an apocalyptic number.
It is an amenable number.
43486640952 is an abundant number, since it is smaller than the sum of its proper divisors (65832617928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43486640952 is a wasteful number, since it uses less digits than its factorization.
43486640952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9932 (or 9928 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 51.
The spelling of 43486640952 in words is "forty-three billion, four hundred eighty-six million, six hundred forty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •