Base | Representation |
---|---|
bin | 1100001010100… |
… | …00111100100111 |
3 | 21010000100021100 |
4 | 12011100330213 |
5 | 202110342211 |
6 | 14043051143 |
7 | 2346232500 |
oct | 605207447 |
9 | 233010240 |
10 | 102043431 |
11 | 52667816 |
12 | 2a210ab3 |
13 | 181aa939 |
14 | d7a3ba7 |
15 | 8e5a156 |
hex | 6150f27 |
102043431 has 72 divisors (see below), whose sum is σ = 181396800. Its totient is φ = 55036800.
The previous prime is 102043421. The next prime is 102043441. The reversal of 102043431 is 134340201.
It is an interprime number because it is at equal distance from previous prime (102043421) and next prime (102043441).
It is not a de Polignac number, because 102043431 - 27 = 102043303 is a prime.
It is a super-2 number, since 2×1020434312 = 20825723620503522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102043421) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 1010281 + ... + 1010381.
It is an arithmetic number, because the mean of its divisors is an integer number (2519400).
Almost surely, 2102043431 is an apocalyptic number.
102043431 is a deficient number, since it is larger than the sum of its proper divisors (79353369).
102043431 is a wasteful number, since it uses less digits than its factorization.
102043431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229 (or 219 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 102043431 is about 10101.6548644269. The cubic root of 102043431 is about 467.2991784285.
Adding to 102043431 its reverse (134340201), we get a palindrome (236383632).
The spelling of 102043431 in words is "one hundred two million, forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •