Base | Representation |
---|---|
bin | 10000100111100111000… |
… | …001010000110011110101 |
3 | 11001011210212212212210122 |
4 | 100213213001100303311 |
5 | 122202400300420313 |
6 | 2232351423501325 |
7 | 145336604354045 |
oct | 20474701206365 |
9 | 4034725785718 |
10 | 1142042201333 |
11 | 400379060130 |
12 | 165403757845 |
13 | 83903c8c697 |
14 | 3d3bcd97725 |
15 | 1ea918d4708 |
hex | 109e7050cf5 |
1142042201333 has 8 divisors (see below), whose sum is σ = 1247317980480. Its totient is φ = 1037008715680.
The previous prime is 1142042201329. The next prime is 1142042201369. The reversal of 1142042201333 is 3331022402411.
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 1142042201333 - 22 = 1142042201329 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1142042201303) 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 7 ways as a sum of consecutive naturals, for example, 60563513 + ... + 60582366.
It is an arithmetic number, because the mean of its divisors is an integer number (155914747560).
Almost surely, 21142042201333 is an apocalyptic number.
It is an amenable number.
1142042201333 is a deficient number, since it is larger than the sum of its proper divisors (105275779147).
1142042201333 is a wasteful number, since it uses less digits than its factorization.
1142042201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121146747.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1142042201333 its reverse (3331022402411), we get a palindrome (4473064603744).
The spelling of 1142042201333 in words is "one trillion, one hundred forty-two billion, forty-two million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •