Base | Representation |
---|---|
bin | 10111000010101111001000… |
… | …010001101100100001100110 |
3 | 111021211022021211012012121212 |
4 | 113002233020101230201212 |
5 | 101240401144014244032 |
6 | 555312214504511422 |
7 | 30226540553012312 |
oct | 2702571021544146 |
9 | 437738254165555 |
10 | 101343113431142 |
11 | 2a3224115822a0 |
12 | b448b8377b572 |
13 | 44717cb34118b |
14 | 1b0506625ab42 |
15 | bab2786c9bb2 |
hex | 5c2bc846c866 |
101343113431142 has 8 divisors (see below), whose sum is σ = 165834185614632. Its totient is φ = 46065051559600.
The previous prime is 101343113431129. The next prime is 101343113431187. The reversal of 101343113431142 is 241134311343101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 101343113431099 and 101343113431108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2303252577959 + ... + 2303252578002.
It is an arithmetic number, because the mean of its divisors is an integer number (20729273201829).
Almost surely, 2101343113431142 is an apocalyptic number.
101343113431142 is a deficient number, since it is larger than the sum of its proper divisors (64491072183490).
101343113431142 is a wasteful number, since it uses less digits than its factorization.
101343113431142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4606505155974.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 101343113431142 its reverse (241134311343101), we get a palindrome (342477424774243).
The spelling of 101343113431142 in words is "one hundred one trillion, three hundred forty-three billion, one hundred thirteen million, four hundred thirty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •