Base | Representation |
---|---|
bin | 10111000101100111000000… |
… | …010011010010110110001110 |
3 | 111022112011220101101222222001 |
4 | 113011213000103102312032 |
5 | 101302120020310100032 |
6 | 555543030035342514 |
7 | 30250030304155654 |
oct | 2705470023226616 |
9 | 438464811358861 |
10 | 101540548128142 |
11 | 2a399117297372 |
12 | b47b2a4151a3a |
13 | 4487304048286 |
14 | 1b1083576cdd4 |
15 | bb14818243e7 |
hex | 5c59c04d2d8e |
101540548128142 has 8 divisors (see below), whose sum is σ = 158933031852816. Its totient is φ = 48562870843872.
The previous prime is 101540548128091. The next prime is 101540548128167. The reversal of 101540548128142 is 241821845045101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (46), and also a Moran number because the ratio is a prime number: 2207403220177 = 101540548128142 / (1 + 0 + 1 + 5 + 4 + 0 + 5 + 4 + 8 + 1 + 2 + 8 + 1 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 101540548128092 and 101540548128101.
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, 1103701610043 + ... + 1103701610134.
It is an arithmetic number, because the mean of its divisors is an integer number (19866628981602).
Almost surely, 2101540548128142 is an apocalyptic number.
101540548128142 is a deficient number, since it is larger than the sum of its proper divisors (57392483724674).
101540548128142 is a wasteful number, since it uses less digits than its factorization.
101540548128142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2207403220202.
The product of its (nonzero) digits is 409600, while the sum is 46.
The spelling of 101540548128142 in words is "one hundred one trillion, five hundred forty billion, five hundred forty-eight million, one hundred twenty-eight thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •