Base | Representation |
---|---|
bin | 101000011101010001… |
… | …000111011010101101 |
3 | 11011010110100011021202 |
4 | 220131101013122231 |
5 | 1202431304332203 |
6 | 31542324535245 |
7 | 3065333564243 |
oct | 503521073255 |
9 | 134113304252 |
10 | 43440699053 |
11 | 17472162184 |
12 | 8504251525 |
13 | 4133b5816b |
14 | 2161530793 |
15 | 11e3acd388 |
hex | a1d4476ad |
43440699053 has 2 divisors, whose sum is σ = 43440699054. Its totient is φ = 43440699052.
The previous prime is 43440699047. The next prime is 43440699059. The reversal of 43440699053 is 35099604434.
43440699053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (43440699047) and next prime (43440699059).
It can be written as a sum of positive squares in only one way, i.e., 41649462724 + 1791236329 = 204082^2 + 42323^2 .
It is a cyclic number.
It is not a de Polignac number, because 43440699053 - 210 = 43440698029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43440698989 and 43440699007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43440699059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21720349526 + 21720349527.
It is an arithmetic number, because the mean of its divisors is an integer number (21720349527).
Almost surely, 243440699053 is an apocalyptic number.
It is an amenable number.
43440699053 is a deficient number, since it is larger than the sum of its proper divisors (1).
43440699053 is an equidigital number, since it uses as much as digits as its factorization.
43440699053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1399680, while the sum is 47.
The spelling of 43440699053 in words is "forty-three billion, four hundred forty million, six hundred ninety-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •