Base | Representation |
---|---|
bin | 101000000101101000… |
… | …001110000001100001 |
3 | 11010002211001221201221 |
4 | 220011220032001201 |
5 | 1201123242232431 |
6 | 31435120255041 |
7 | 3052446555310 |
oct | 500550160141 |
9 | 133084057657 |
10 | 43044102241 |
11 | 17289301118 |
12 | 8413471481 |
13 | 409c9388aa |
14 | 21249b4277 |
15 | 11bdd8d111 |
hex | a05a0e061 |
43044102241 has 4 divisors (see below), whose sum is σ = 49193259712. Its totient is φ = 36894944772.
The previous prime is 43044102239. The next prime is 43044102247. The reversal of 43044102241 is 14220144034.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14220144034 = 2 ⋅7110072017.
It is not a de Polignac number, because 43044102241 - 21 = 43044102239 is a prime.
It is a super-2 number, since 2×430441022412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (43044102247) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3074578725 + ... + 3074578738.
It is an arithmetic number, because the mean of its divisors is an integer number (12298314928).
Almost surely, 243044102241 is an apocalyptic number.
It is an amenable number.
43044102241 is a deficient number, since it is larger than the sum of its proper divisors (6149157471).
43044102241 is an equidigital number, since it uses as much as digits as its factorization.
43044102241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6149157470.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 43044102241 its reverse (14220144034), we get a palindrome (57264246275).
The spelling of 43044102241 in words is "forty-three billion, forty-four million, one hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •