Base | Representation |
---|---|
bin | 10000101000110010101… |
… | …101111011011001111110 |
3 | 11001022002101121120022000 |
4 | 100220302231323121332 |
5 | 122213000410420332 |
6 | 2233121432203130 |
7 | 145413225236013 |
oct | 20506255733176 |
9 | 4038071546260 |
10 | 1143312201342 |
11 | 40096aa27a13 |
12 | 1656b8b394a6 |
13 | 83a7712268c |
14 | 3d49d90970a |
15 | 1eb1814ab7c |
hex | 10a32b7b67e |
1143312201342 has 32 divisors (see below), whose sum is σ = 2609361184800. Its totient is φ = 370803956544.
The previous prime is 1143312201337. The next prime is 1143312201359. The reversal of 1143312201342 is 2431022133411.
1143312201342 is a `hidden beast` number, since 1 + 1 + 4 + 3 + 312 + 2 + 0 + 1 + 342 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286112167 + ... + 286116162.
It is an arithmetic number, because the mean of its divisors is an integer number (81542537025).
Almost surely, 21143312201342 is an apocalyptic number.
1143312201342 is an abundant number, since it is smaller than the sum of its proper divisors (1466048983458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1143312201342 is a wasteful number, since it uses less digits than its factorization.
1143312201342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 572228377 (or 572228371 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1143312201342 its reverse (2431022133411), we get a palindrome (3574334334753).
The spelling of 1143312201342 in words is "one trillion, one hundred forty-three billion, three hundred twelve million, two hundred one thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •