Base | Representation |
---|---|
bin | 101000000101100000… |
… | …100110110010100101 |
3 | 11010002200022120010211 |
4 | 220011200212302211 |
5 | 1201122234402113 |
6 | 31435005415421 |
7 | 3052423604026 |
oct | 500540466245 |
9 | 133080276124 |
10 | 43042106533 |
11 | 17288168778 |
12 | 841286a571 |
13 | 409c3ba3ba |
14 | 2124614c4d |
15 | 11bdae6b3d |
hex | a05826ca5 |
43042106533 has 4 divisors (see below), whose sum is σ = 43043726700. Its totient is φ = 43040486368.
The previous prime is 43042106531. The next prime is 43042106537. The reversal of 43042106533 is 33560124034.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33560124034 = 2 ⋅16780062017.
It can be written as a sum of positive squares in 2 ways, for example, as 24747379969 + 18294726564 = 157313^2 + 135258^2 .
It is a cyclic number.
It is not a de Polignac number, because 43042106533 - 21 = 43042106531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43042106495 and 43042106504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43042106531) 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, 769558 + ... + 823591.
It is an arithmetic number, because the mean of its divisors is an integer number (10760931675).
Almost surely, 243042106533 is an apocalyptic number.
It is an amenable number.
43042106533 is a deficient number, since it is larger than the sum of its proper divisors (1620167).
43042106533 is a wasteful number, since it uses less digits than its factorization.
43042106533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1620166.
The product of its (nonzero) digits is 25920, while the sum is 31.
The spelling of 43042106533 in words is "forty-three billion, forty-two million, one hundred six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •