Base | Representation |
---|---|
bin | 101000101010100110… |
… | …101101100001000101 |
3 | 11011201001101121000012 |
4 | 220222212231201011 |
5 | 1203411100321231 |
6 | 32020441000005 |
7 | 3104021551100 |
oct | 505246554105 |
9 | 134631347005 |
10 | 43664463941 |
11 | 175774a703a |
12 | 8567183005 |
13 | 416b313417 |
14 | 218313b737 |
15 | 120857de2b |
hex | a2a9ad845 |
43664463941 has 6 divisors (see below), whose sum is σ = 50793356070. Its totient is φ = 37426683336.
The previous prime is 43664463929. The next prime is 43664463967. The reversal of 43664463941 is 14936446634.
It can be written as a sum of positive squares in only one way, i.e., 43251520900 + 412943041 = 207970^2 + 20321^2 .
It is not a de Polignac number, because 43664463941 - 226 = 43597355077 is a prime.
It is a super-2 number, since 2×436644639412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 43664463941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43664463991) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 445555706 + ... + 445555803.
It is an arithmetic number, because the mean of its divisors is an integer number (8465559345).
Almost surely, 243664463941 is an apocalyptic number.
It is an amenable number.
43664463941 is a deficient number, since it is larger than the sum of its proper divisors (7128892129).
43664463941 is an equidigital number, since it uses as much as digits as its factorization.
43664463941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 891111523 (or 891111516 counting only the distinct ones).
The product of its digits is 4478976, while the sum is 50.
The spelling of 43664463941 in words is "forty-three billion, six hundred sixty-four million, four hundred sixty-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •