Base | Representation |
---|---|
bin | 10111000101001110110010… |
… | …101111101001101111010101 |
3 | 111022102200210120222210221212 |
4 | 113011032302233221233111 |
5 | 101301203300011032031 |
6 | 555523050232151205 |
7 | 30245120130163163 |
oct | 2705166257515725 |
9 | 438380716883855 |
10 | 101514550877141 |
11 | 2a389096544966 |
12 | b476249838505 |
13 | 4484a20027c0c |
14 | 1b0d48ab92233 |
15 | bb095e31512b |
hex | 5c53b2be9bd5 |
101514550877141 has 8 divisors (see below), whose sum is σ = 104268531870720. Its totient is φ = 98761114330128.
The previous prime is 101514550877123. The next prime is 101514550877149. The reversal of 101514550877141 is 141778055415101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101514550877141 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101514550877141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101514550877149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135733661 + ... + 136479506.
It is an arithmetic number, because the mean of its divisors is an integer number (13033566483840).
Almost surely, 2101514550877141 is an apocalyptic number.
It is an amenable number.
101514550877141 is a deficient number, since it is larger than the sum of its proper divisors (2753980993579).
101514550877141 is a wasteful number, since it uses less digits than its factorization.
101514550877141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272223283.
The product of its (nonzero) digits is 784000, while the sum is 50.
The spelling of 101514550877141 in words is "one hundred one trillion, five hundred fourteen billion, five hundred fifty million, eight hundred seventy-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •