Base | Representation |
---|---|
bin | 111110110001000… |
… | …010101011100111 |
3 | 2201101111011000120 |
4 | 332301002223213 |
5 | 4124034342211 |
6 | 252254213023 |
7 | 35044502316 |
oct | 7661025347 |
9 | 2641434016 |
10 | 1053043431 |
11 | 4a0463130 |
12 | 2547b4173 |
13 | 13a21c92b |
14 | 9dbd827d |
15 | 626acd06 |
hex | 3ec42ae7 |
1053043431 has 32 divisors (see below), whose sum is σ = 1608657408. Its totient is φ = 606503040.
The previous prime is 1053043417. The next prime is 1053043457. The reversal of 1053043431 is 1343403501.
It is a happy number.
It is not a de Polignac number, because 1053043431 - 29 = 1053042919 is a prime.
It is a super-2 number, since 2×10530434312 = 2217800935144503522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053043471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 114745 + ... + 123581.
It is an arithmetic number, because the mean of its divisors is an integer number (50270544).
Almost surely, 21053043431 is an apocalyptic number.
1053043431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1053043431 is a deficient number, since it is larger than the sum of its proper divisors (555613977).
1053043431 is a wasteful number, since it uses less digits than its factorization.
1053043431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9031.
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 1053043431 is about 32450.6306718375. The cubic root of 1053043431 is about 1017.3774197684.
Adding to 1053043431 its reverse (1343403501), we get a palindrome (2396446932).
The spelling of 1053043431 in words is "one billion, fifty-three million, forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •