Base | Representation |
---|---|
bin | 10000101000000010011… |
… | …000001101010100110101 |
3 | 11001012222212120111020220 |
4 | 100220002120031110311 |
5 | 122204320301414310 |
6 | 2232505141444553 |
7 | 145354146656100 |
oct | 20500230152465 |
9 | 4035885514226 |
10 | 1142501201205 |
11 | 400594163571 |
12 | 165511410759 |
13 | 839780ba940 |
14 | 3d423d19737 |
15 | 1eabbd4e670 |
hex | 10a0260d535 |
1142501201205 has 192 divisors, whose sum is σ = 2371356207360. Its totient is φ = 465021333504.
The previous prime is 1142501201143. The next prime is 1142501201207. The reversal of 1142501201205 is 5021021052411.
It is a happy number.
It is not a de Polignac number, because 1142501201205 - 29 = 1142501200693 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1142501201207) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 477433489 + ... + 477435881.
It is an arithmetic number, because the mean of its divisors is an integer number (12350813580).
Almost surely, 21142501201205 is an apocalyptic number.
1142501201205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1142501201205 is an abundant number, since it is smaller than the sum of its proper divisors (1228855006155).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142501201205 is a wasteful number, since it uses less digits than its factorization.
1142501201205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4180 (or 4173 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 1142501201205 its reverse (5021021052411), we get a palindrome (6163522253616).
The spelling of 1142501201205 in words is "one trillion, one hundred forty-two billion, five hundred one million, two hundred one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •