Base | Representation |
---|---|
bin | 101000110110010010… |
… | …100011010110111001 |
3 | 11012012201021120012201 |
4 | 220312102203112321 |
5 | 1204311242143131 |
6 | 32052122510201 |
7 | 3111622102312 |
oct | 506622432671 |
9 | 135181246181 |
10 | 43860506041 |
11 | 17668126400 |
12 | 8600965361 |
13 | 419cb13071 |
14 | 21a11ad609 |
15 | 121a8a5761 |
hex | a364a35b9 |
43860506041 has 27 divisors (see below), whose sum is σ = 49031737839. Its totient is φ = 39205108800.
The previous prime is 43860505957. The next prime is 43860506059. The reversal of 43860506041 is 14060506834.
It is a happy number.
The square root of 43860506041 is 209429.
It is a perfect power (a square), and thus also a powerful number.
43860506041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 32986187641 + 10874318400 = 181621^2 + 104280^2 .
It is not a de Polignac number, because 43860506041 - 211 = 43860503993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (43860500041) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 181993681 + ... + 181993921.
Almost surely, 243860506041 is an apocalyptic number.
43860506041 is the 209429-th square number.
43860506041 is the 104715-th centered octagonal number.
It is an amenable number.
43860506041 is a deficient number, since it is larger than the sum of its proper divisors (5171231798).
43860506041 is an frugal number, since it uses more digits than its factorization.
43860506041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 662 (or 331 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 43860506041 in words is "forty-three billion, eight hundred sixty million, five hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •