Base | Representation |
---|---|
bin | 10000101000111001011… |
… | …110110001010111011101 |
3 | 11001022101022010022002001 |
4 | 100220321132301113131 |
5 | 122213213432343243 |
6 | 2233141004202301 |
7 | 145416103551166 |
oct | 20507136612735 |
9 | 4038338108061 |
10 | 1143425668573 |
11 | 400a18a87591 |
12 | 16572ab39391 |
13 | 83a9479cc56 |
14 | 3d4b0a0476d |
15 | 1eb230b0a4d |
hex | 10a397b15dd |
1143425668573 has 4 divisors (see below), whose sum is σ = 1143427983808. Its totient is φ = 1143423353340.
The previous prime is 1143425668537. The next prime is 1143425668603. The reversal of 1143425668573 is 3758665243411.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1143425668573 is a prime.
It is a super-2 number, since 2×11434256685732 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1143425666573) 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, 86373 + ... + 1514698.
It is an arithmetic number, because the mean of its divisors is an integer number (285856995952).
Almost surely, 21143425668573 is an apocalyptic number.
It is an amenable number.
1143425668573 is a deficient number, since it is larger than the sum of its proper divisors (2315235).
1143425668573 is an equidigital number, since it uses as much as digits as its factorization.
1143425668573 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2315234.
The product of its digits is 14515200, while the sum is 55.
The spelling of 1143425668573 in words is "one trillion, one hundred forty-three billion, four hundred twenty-five million, six hundred sixty-eight thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •