Base | Representation |
---|---|
bin | 10101000110001100… |
… | …01111010101010011 |
3 | 1002020100100102222021 |
4 | 22203012033111103 |
5 | 141144010201332 |
6 | 5111520552311 |
7 | 550450406611 |
oct | 124306172523 |
9 | 32210312867 |
10 | 11326256467 |
11 | 4892416139 |
12 | 2241182697 |
13 | 10b66b9506 |
14 | 79635a6b1 |
15 | 464537c97 |
hex | 2a318f553 |
11326256467 has 4 divisors (see below), whose sum is σ = 11351040856. Its totient is φ = 11301472080.
The previous prime is 11326256449. The next prime is 11326256479. The reversal of 11326256467 is 76465262311.
11326256467 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: 76465262311 = 4483 ⋅17056717.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11326256467 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11326206467) 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, 12391509 + ... + 12392422.
It is an arithmetic number, because the mean of its divisors is an integer number (2837760214).
Almost surely, 211326256467 is an apocalyptic number.
11326256467 is a deficient number, since it is larger than the sum of its proper divisors (24784389).
11326256467 is an equidigital number, since it uses as much as digits as its factorization.
11326256467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24784388.
The product of its digits is 362880, while the sum is 43.
The spelling of 11326256467 in words is "eleven billion, three hundred twenty-six million, two hundred fifty-six thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •