Base | Representation |
---|---|
bin | 10111111111110101111101… |
… | …010110110101000101011011 |
3 | 111211200202012202110212001201 |
4 | 113333311331112311011123 |
5 | 102313201200113014321 |
6 | 1012245251253455031 |
7 | 31142116303122616 |
oct | 2777657526650533 |
9 | 454622182425051 |
10 | 105542334501211 |
11 | 306a1286385513 |
12 | ba0698a341477 |
13 | 46b77a3c7239a |
14 | 1c0c3c203917d |
15 | c305e9545291 |
hex | 5ffd7d5b515b |
105542334501211 has 8 divisors (see below), whose sum is σ = 108089033585984. Its totient is φ = 102999827516040.
The previous prime is 105542334501173. The next prime is 105542334501281. The reversal of 105542334501211 is 112105433245501.
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 105542334501211 - 213 = 105542334493019 is a prime.
It is a super-2 number, since 2×1055423345012112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105542334501281) 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, 1047973941 + ... + 1048074646.
It is an arithmetic number, because the mean of its divisors is an integer number (13511129198248).
Almost surely, 2105542334501211 is an apocalyptic number.
105542334501211 is a deficient number, since it is larger than the sum of its proper divisors (2546699084773).
105542334501211 is a wasteful number, since it uses less digits than its factorization.
105542334501211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2096049801.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 105542334501211 its reverse (112105433245501), we get a palindrome (217647767746712).
The spelling of 105542334501211 in words is "one hundred five trillion, five hundred forty-two billion, three hundred thirty-four million, five hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •