Base | Representation |
---|---|
bin | 101000110110010100… |
… | …011011111101000000 |
3 | 11012012202012122210111 |
4 | 220312110123331000 |
5 | 1204311404000000 |
6 | 32052141241104 |
7 | 3111626230366 |
oct | 506624337500 |
9 | 135182178714 |
10 | 43861000000 |
11 | 17668433534 |
12 | 8600b63194 |
13 | 419cc56b4c |
14 | 21a129b636 |
15 | 121a951cba |
hex | a3651bf40 |
43861000000 has 196 divisors, whose sum is σ = 113584171104. Its totient is φ = 16772800000.
The previous prime is 43860999937. The next prime is 43861000003. The reversal of 43861000000 is 16834.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43861000003) 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 27 ways as a sum of consecutive naturals, for example, 22999047 + ... + 23000953.
Almost surely, 243861000000 is an apocalyptic number.
43861000000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 43861000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56792085552).
43861000000 is an abundant number, since it is smaller than the sum of its proper divisors (69723171104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43861000000 is an frugal number, since it uses more digits than its factorization.
43861000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1972 (or 1937 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 43861000000 its reverse (16834), we get a palindrome (43861016834).
The spelling of 43861000000 in words is "forty-three billion, eight hundred sixty-one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •