Base | Representation |
---|---|
bin | 101000000100001100… |
… | …010111010100000101 |
3 | 11010001010202121021212 |
4 | 220010030113110011 |
5 | 1201101111214140 |
6 | 31432500221205 |
7 | 3052035106466 |
oct | 500414272405 |
9 | 133033677255 |
10 | 43020023045 |
11 | 1727675505a |
12 | 840739a805 |
13 | 409795784c |
14 | 2121706d6d |
15 | 11bbbd3765 |
hex | a04317505 |
43020023045 has 4 divisors (see below), whose sum is σ = 51624027660. Its totient is φ = 34416018432.
The previous prime is 43020023023. The next prime is 43020023077. The reversal of 43020023045 is 54032002034.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22069776481 + 20950246564 = 148559^2 + 144742^2 .
It is a cyclic number.
It is not a de Polignac number, because 43020023045 - 28 = 43020022789 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 43020023045.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4302002300 + ... + 4302002309.
It is an arithmetic number, because the mean of its divisors is an integer number (12906006915).
Almost surely, 243020023045 is an apocalyptic number.
It is an amenable number.
43020023045 is a deficient number, since it is larger than the sum of its proper divisors (8604004615).
43020023045 is an equidigital number, since it uses as much as digits as its factorization.
43020023045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8604004614.
The product of its (nonzero) digits is 2880, while the sum is 23.
Adding to 43020023045 its reverse (54032002034), we get a palindrome (97052025079).
The spelling of 43020023045 in words is "forty-three billion, twenty million, twenty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •