Base | Representation |
---|---|
bin | 10101001111011001… |
… | …01001100111000010 |
3 | 1002102201120111020111 |
4 | 22213230221213002 |
5 | 141323234400214 |
6 | 5123315101534 |
7 | 552405410350 |
oct | 124754514702 |
9 | 32381514214 |
10 | 11403434434 |
11 | 4921a3a087 |
12 | 2262ba18aa |
13 | 10c969c252 |
14 | 7a26ca7d0 |
15 | 46b1d05c4 |
hex | 2a7b299c2 |
11403434434 has 8 divisors (see below), whose sum is σ = 19548744768. Its totient is φ = 4887186180.
The previous prime is 11403434429. The next prime is 11403434467. The reversal of 11403434434 is 43443430411.
It is a happy number.
11403434434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11403434396 and 11403434405.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 407265502 + ... + 407265529.
It is an arithmetic number, because the mean of its divisors is an integer number (2443593096).
Almost surely, 211403434434 is an apocalyptic number.
11403434434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11403434434 is a deficient number, since it is larger than the sum of its proper divisors (8145310334).
11403434434 is an equidigital number, since it uses as much as digits as its factorization.
11403434434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 814531040.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 11403434434 its reverse (43443430411), we get a palindrome (54846864845).
The spelling of 11403434434 in words is "eleven billion, four hundred three million, four hundred thirty-four thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •