Base | Representation |
---|---|
bin | 10000100111111000111… |
… | …110101000110101100001 |
3 | 11001012120212211121021002 |
4 | 100213320332220311201 |
5 | 122204004414100301 |
6 | 2232441345441345 |
7 | 145350223365125 |
oct | 20477076506541 |
9 | 4035525747232 |
10 | 1142343503201 |
11 | 40051314373a |
12 | 165488640255 |
13 | 83951524c04 |
14 | 3d40adc9585 |
15 | 1eaad09e16b |
hex | 109f8fa8d61 |
1142343503201 has 8 divisors (see below), whose sum is σ = 1149050032680. Its totient is φ = 1135638162432.
The previous prime is 1142343503173. The next prime is 1142343503227. The reversal of 1142343503201 is 1023053432411.
It can be written as a sum of positive squares in 4 ways, for example, as 688335715600 + 454007787601 = 829660^2 + 673801^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1142343503201 - 230 = 1141269761377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1142343503261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1668491 + ... + 2251343.
It is an arithmetic number, because the mean of its divisors is an integer number (143631254085).
Almost surely, 21142343503201 is an apocalyptic number.
It is an amenable number.
1142343503201 is a deficient number, since it is larger than the sum of its proper divisors (6706529479).
1142343503201 is a wasteful number, since it uses less digits than its factorization.
1142343503201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594355.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 1142343503201 its reverse (1023053432411), we get a palindrome (2165396935612).
The spelling of 1142343503201 in words is "one trillion, one hundred forty-two billion, three hundred forty-three million, five hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •