Base | Representation |
---|---|
bin | 101000000100010001… |
… | …000011110111110100 |
3 | 11010001020002011000200 |
4 | 220010101003313310 |
5 | 1201101420113012 |
6 | 31432542440500 |
7 | 3052051424613 |
oct | 500421036764 |
9 | 133036064020 |
10 | 43021254132 |
11 | 17277415a8a |
12 | 8407893130 |
13 | 4097c98cbc |
14 | 212194787a |
15 | 11bbd783dc |
hex | a04443df4 |
43021254132 has 36 divisors (see below), whose sum is σ = 109171338276. Its totient is φ = 14284615680.
The previous prime is 43021254131. The next prime is 43021254217. The reversal of 43021254132 is 23145212034.
43021254132 is a `hidden beast` number, since 4 + 30 + 212 + 5 + 413 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19659965796 + 23361288336 = 140214^2 + 152844^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 43021254096 and 43021254105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43021254131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2315719 + ... + 2334222.
Almost surely, 243021254132 is an apocalyptic number.
It is an amenable number.
43021254132 is an abundant number, since it is smaller than the sum of its proper divisors (66150084144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43021254132 is a wasteful number, since it uses less digits than its factorization.
43021254132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4650208 (or 4650203 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 43021254132 its reverse (23145212034), we get a palindrome (66166466166).
The spelling of 43021254132 in words is "forty-three billion, twenty-one million, two hundred fifty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •