Base | Representation |
---|---|
bin | 10000101000101001001… |
… | …111000000111100011111 |
3 | 11001021200022020111212212 |
4 | 100220221033000330133 |
5 | 122212134143240443 |
6 | 2233053550151035 |
7 | 145406254022240 |
oct | 20505117007437 |
9 | 4037608214785 |
10 | 1143153102623 |
11 | 400899140774 |
12 | 1656737b247b |
13 | 83a5018921c |
14 | 3d486732cc7 |
15 | 1eb091c0618 |
hex | 10a293c0f1f |
1143153102623 has 4 divisors (see below), whose sum is σ = 1306460688720. Its totient is φ = 979845516528.
The previous prime is 1143153102571. The next prime is 1143153102659. The reversal of 1143153102623 is 3262013513411.
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 1143153102623 - 216 = 1143153037087 is a prime.
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 1143153102623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1143153108623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81653793038 + ... + 81653793051.
It is an arithmetic number, because the mean of its divisors is an integer number (326615172180).
Almost surely, 21143153102623 is an apocalyptic number.
1143153102623 is a deficient number, since it is larger than the sum of its proper divisors (163307586097).
1143153102623 is an equidigital number, since it uses as much as digits as its factorization.
1143153102623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163307586096.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 1143153102623 in words is "one trillion, one hundred forty-three billion, one hundred fifty-three million, one hundred two thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •