Base | Representation |
---|---|
bin | 101000111000101001… |
… | …010010100011011101 |
3 | 11012022110122010111010 |
4 | 220320221102203131 |
5 | 1204401401132312 |
6 | 32100053445433 |
7 | 3112612010202 |
oct | 507051224335 |
9 | 135273563433 |
10 | 43900020957 |
11 | 17688465561 |
12 | 8612040879 |
13 | 41a8069b80 |
14 | 21a6537ca9 |
15 | 121e0ad93c |
hex | a38a528dd |
43900020957 has 8 divisors (see below), whose sum is σ = 63035927584. Its totient is φ = 27015397488.
The previous prime is 43900020947. The next prime is 43900021019. The reversal of 43900020957 is 75902000934.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 43900020957 - 224 = 43883243741 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1125641563 = 43900020957 / (4 + 3 + 9 + 0 + 0 + 0 + 2 + 0 + 9 + 5 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43900020947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 562820743 + ... + 562820820.
It is an arithmetic number, because the mean of its divisors is an integer number (7879490948).
Almost surely, 243900020957 is an apocalyptic number.
It is an amenable number.
43900020957 is a deficient number, since it is larger than the sum of its proper divisors (19135906627).
43900020957 is a wasteful number, since it uses less digits than its factorization.
43900020957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125641579.
The product of its (nonzero) digits is 68040, while the sum is 39.
The spelling of 43900020957 in words is "forty-three billion, nine hundred million, twenty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •