Base | Representation |
---|---|
bin | 1010011010101110101010… |
… | …1100100010110001001111 |
3 | 1111120000121021120001210020 |
4 | 2212223222230202301033 |
5 | 3000131422002401211 |
6 | 40210013033313223 |
7 | 2261355510405411 |
oct | 246535254426117 |
9 | 44500537501706 |
10 | 11454320356431 |
11 | 3716828256067 |
12 | 134bb10865813 |
13 | 6511a38cb024 |
14 | 2b856bb709b1 |
15 | 14ce46d9d306 |
hex | a6aeab22c4f |
11454320356431 has 4 divisors (see below), whose sum is σ = 15272427141912. Its totient is φ = 7636213570952.
The previous prime is 11454320356429. The next prime is 11454320356529. The reversal of 11454320356431 is 13465302345411.
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 11454320356431 - 21 = 11454320356429 is a prime.
It is a super-2 number, since 2×114543203564312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11454320351431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1909053392736 + ... + 1909053392741.
It is an arithmetic number, because the mean of its divisors is an integer number (3818106785478).
Almost surely, 211454320356431 is an apocalyptic number.
11454320356431 is a deficient number, since it is larger than the sum of its proper divisors (3818106785481).
11454320356431 is an equidigital number, since it uses as much as digits as its factorization.
11454320356431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3818106785480.
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 11454320356431 in words is "eleven trillion, four hundred fifty-four billion, three hundred twenty million, three hundred fifty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •