Base | Representation |
---|---|
bin | 101000100001000011… |
… | …100011010011101100 |
3 | 11011021212220222201210 |
4 | 220201003203103230 |
5 | 1203044042032030 |
6 | 31552515034420 |
7 | 3100035020226 |
oct | 504103432354 |
9 | 134255828653 |
10 | 43504252140 |
11 | 174a501a598 |
12 | 852159ba10 |
13 | 414407a43b |
14 | 2169b55416 |
15 | 11e9483bb0 |
hex | a210e34ec |
43504252140 has 96 divisors (see below), whose sum is σ = 123287463936. Its totient is φ = 11461144320.
The previous prime is 43504252123. The next prime is 43504252151. The reversal of 43504252140 is 4125240534.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 43504252098 and 43504252107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2655414 + ... + 2671746.
It is an arithmetic number, because the mean of its divisors is an integer number (1284244416).
Almost surely, 243504252140 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 43504252140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61643731968).
43504252140 is an abundant number, since it is smaller than the sum of its proper divisors (79783211796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43504252140 is a wasteful number, since it uses less digits than its factorization.
43504252140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16879 (or 16877 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 43504252140 its reverse (4125240534), we get a palindrome (47629492674).
The spelling of 43504252140 in words is "forty-three billion, five hundred four million, two hundred fifty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •