Base | Representation |
---|---|
bin | 10101001000001100… |
… | …01010101000100001 |
3 | 1002021111212211120200 |
4 | 22210012022220201 |
5 | 141212302430213 |
6 | 5113320055413 |
7 | 551043013632 |
oct | 124406125041 |
9 | 32244784520 |
10 | 11343014433 |
11 | 48a09216a3 |
12 | 2246904569 |
13 | 10ba00607a |
14 | 79867d889 |
15 | 465c48273 |
hex | 2a418aa21 |
11343014433 has 12 divisors (see below), whose sum is σ = 16401778068. Its totient is φ = 7553967840.
The previous prime is 11343014399. The next prime is 11343014437. The reversal of 11343014433 is 33441034311.
It can be written as a sum of positive squares in 2 ways, for example, as 4479223329 + 6863791104 = 66927^2 + 82848^2 .
It is a de Polignac number, because none of the positive numbers 2k-11343014433 is a prime.
It is a super-2 number, since 2×113430144332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11343014397 and 11343014406.
It is not an unprimeable number, because it can be changed into a prime (11343014437) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 661210 + ... + 678147.
It is an arithmetic number, because the mean of its divisors is an integer number (1366814839).
Almost surely, 211343014433 is an apocalyptic number.
It is an amenable number.
11343014433 is a deficient number, since it is larger than the sum of its proper divisors (5058763635).
11343014433 is a wasteful number, since it uses less digits than its factorization.
11343014433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1340304 (or 1340301 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 11343014433 its reverse (33441034311), we get a palindrome (44784048744).
The spelling of 11343014433 in words is "eleven billion, three hundred forty-three million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •