Base | Representation |
---|---|
bin | 10101010111010000… |
… | …01000001101110111 |
3 | 1002121022121202021221 |
4 | 22223220020031313 |
5 | 141442123423233 |
6 | 5134032051211 |
7 | 554135635231 |
oct | 125350101567 |
9 | 32538552257 |
10 | 11469357943 |
11 | 495617641a |
12 | 2281093b07 |
13 | 110a241444 |
14 | 7ab36b251 |
15 | 471da342d |
hex | 2aba08377 |
11469357943 has 4 divisors (see below), whose sum is σ = 11476435048. Its totient is φ = 11462280840.
The previous prime is 11469357937. The next prime is 11469357973. The reversal of 11469357943 is 34975396411.
11469357943 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34975396411 = 59 ⋅592803329.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11469357943 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11469357973) 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 3 ways as a sum of consecutive naturals, for example, 3536121 + ... + 3539362.
It is an arithmetic number, because the mean of its divisors is an integer number (2869108762).
Almost surely, 211469357943 is an apocalyptic number.
11469357943 is a deficient number, since it is larger than the sum of its proper divisors (7077105).
11469357943 is an equidigital number, since it uses as much as digits as its factorization.
11469357943 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7077104.
The product of its digits is 2449440, while the sum is 52.
The spelling of 11469357943 in words is "eleven billion, four hundred sixty-nine million, three hundred fifty-seven thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •