Base | Representation |
---|---|
bin | 101000011011000001… |
… | …101110111011000101 |
3 | 11011000211121112201121 |
4 | 220123001232323011 |
5 | 1202342144042013 |
6 | 31534503153541 |
7 | 3064366236343 |
oct | 503301567305 |
9 | 134024545647 |
10 | 43403112133 |
11 | 17452a1a607 |
12 | 84b37458b1 |
13 | 4129127a94 |
14 | 215a548993 |
15 | 11e065658d |
hex | a1b06eec5 |
43403112133 has 2 divisors, whose sum is σ = 43403112134. Its totient is φ = 43403112132.
The previous prime is 43403112119. The next prime is 43403112139. The reversal of 43403112133 is 33121130434.
43403112133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31359805569 + 12043306564 = 177087^2 + 109742^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43403112133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43403112098 and 43403112107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43403112139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21701556066 + 21701556067.
It is an arithmetic number, because the mean of its divisors is an integer number (21701556067).
Almost surely, 243403112133 is an apocalyptic number.
It is an amenable number.
43403112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
43403112133 is an equidigital number, since it uses as much as digits as its factorization.
43403112133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 43403112133 its reverse (33121130434), we get a palindrome (76524242567).
The spelling of 43403112133 in words is "forty-three billion, four hundred three million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •