Base | Representation |
---|---|
bin | 1010001000101110100010… |
… | …0011000000010010001111 |
3 | 1110110110022110112020211002 |
4 | 2202023220203000102033 |
5 | 2430100023420444033 |
6 | 35411544100450515 |
7 | 2230126434340001 |
oct | 242135043002217 |
9 | 43413273466732 |
10 | 11145046656143 |
11 | 3607651317554 |
12 | 12bbb996a9a3b |
13 | 62ac866cbcca |
14 | 2a75cd12c371 |
15 | 144d9549b3e8 |
hex | a22e88c048f |
11145046656143 has 4 divisors (see below), whose sum is σ = 11145055840800. Its totient is φ = 11145037471488.
The previous prime is 11145046656131. The next prime is 11145046656187. The reversal of 11145046656143 is 34165664054111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 11145046656143 - 238 = 10870168749199 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 (11145046656193) 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, 2434055 + ... + 5311752.
It is an arithmetic number, because the mean of its divisors is an integer number (2786263960200).
Almost surely, 211145046656143 is an apocalyptic number.
11145046656143 is a deficient number, since it is larger than the sum of its proper divisors (9184657).
11145046656143 is an equidigital number, since it uses as much as digits as its factorization.
11145046656143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9184656.
The product of its (nonzero) digits is 1036800, while the sum is 47.
The spelling of 11145046656143 in words is "eleven trillion, one hundred forty-five billion, forty-six million, six hundred fifty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.013 sec. • engine limits •