Base | Representation |
---|---|
bin | 1010100000000101101100… |
… | …0110100111010100100111 |
3 | 1111212211021111200200002110 |
4 | 2220001123012213110213 |
5 | 3003134012020132411 |
6 | 40320202043412103 |
7 | 2301125366223636 |
oct | 250013306472447 |
9 | 44784244620073 |
10 | 11546400552231 |
11 | 375188a109036 |
12 | 136592a224033 |
13 | 659a89695b9c |
14 | 2bcbc504151d |
15 | 150535b7e2a6 |
hex | a805b1a7527 |
11546400552231 has 4 divisors (see below), whose sum is σ = 15395200736312. Its totient is φ = 7697600368152.
The previous prime is 11546400552173. The next prime is 11546400552251. The reversal of 11546400552231 is 13225500464511.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11546400552231 - 214 = 11546400535847 is a prime.
It is a super-2 number, since 2×115464005522312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11546400552231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11546400552251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1924400092036 + ... + 1924400092041.
It is an arithmetic number, because the mean of its divisors is an integer number (3848800184078).
Almost surely, 211546400552231 is an apocalyptic number.
11546400552231 is a deficient number, since it is larger than the sum of its proper divisors (3848800184081).
11546400552231 is an equidigital number, since it uses as much as digits as its factorization.
11546400552231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3848800184080.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 11546400552231 in words is "eleven trillion, five hundred forty-six billion, four hundred million, five hundred fifty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •