Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …011000110010000101110101 |
3 | 111021000000212122100211112211 |
4 | 112333112020120302011311 |
5 | 101223042003002010031 |
6 | 555013202251413421 |
7 | 30203651602462612 |
oct | 2677261030620565 |
9 | 437000778324484 |
10 | 101110113313141 |
11 | 2a242616036aa9 |
12 | b40b998454271 |
13 | 4455848233a7a |
14 | 1ad7a814d7509 |
15 | ba518d062bb1 |
hex | 5bf588632175 |
101110113313141 has 8 divisors (see below), whose sum is σ = 101540061394560. Its totient is φ = 100680222675648.
The previous prime is 101110113313063. The next prime is 101110113313171. The reversal of 101110113313141 is 141313311011101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101110113313141 - 217 = 101110113182069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110113313171) 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, 10831351 + ... + 17875636.
It is an arithmetic number, because the mean of its divisors is an integer number (12692507674320).
Almost surely, 2101110113313141 is an apocalyptic number.
It is an amenable number.
101110113313141 is a deficient number, since it is larger than the sum of its proper divisors (429948081419).
101110113313141 is a wasteful number, since it uses less digits than its factorization.
101110113313141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28721963.
The product of its (nonzero) digits is 108, while the sum is 22.
Adding to 101110113313141 its reverse (141313311011101), we get a palindrome (242423424324242).
The spelling of 101110113313141 in words is "one hundred one trillion, one hundred ten billion, one hundred thirteen million, three hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •