Base | Representation |
---|---|
bin | 10101001000000100… |
… | …11101100100100111 |
3 | 1002021110001111121122 |
4 | 22210002131210213 |
5 | 141212030342211 |
6 | 5113243204155 |
7 | 551031531005 |
oct | 124402354447 |
9 | 32243044548 |
10 | 11342043431 |
11 | 48a0319114 |
12 | 224651665b |
13 | 10b9a56104 |
14 | 7984a9a75 |
15 | 465b056db |
hex | 2a409d927 |
11342043431 has 4 divisors (see below), whose sum is σ = 11583363552. Its totient is φ = 11100723312.
The previous prime is 11342043421. The next prime is 11342043491. The reversal of 11342043431 is 13434024311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11342043431 - 26 = 11342043367 is a prime.
It is a super-2 number, since 2×113420434312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11342043431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11342043421) 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, 120659990 + ... + 120660083.
It is an arithmetic number, because the mean of its divisors is an integer number (2895840888).
Almost surely, 211342043431 is an apocalyptic number.
11342043431 is a deficient number, since it is larger than the sum of its proper divisors (241320121).
11342043431 is an equidigital number, since it uses as much as digits as its factorization.
11342043431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241320120.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 11342043431 its reverse (13434024311), we get a palindrome (24776067742).
The spelling of 11342043431 in words is "eleven billion, three hundred forty-two million, forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •