Base | Representation |
---|---|
bin | 10111011101110001101001… |
… | …010101000010011101000001 |
3 | 111112101221102221121121212020 |
4 | 113131301221111002131001 |
5 | 102011322120233423131 |
6 | 1003253555025552053 |
7 | 30511020652260066 |
oct | 2735615125023501 |
9 | 445357387547766 |
10 | 103201241311041 |
11 | 2a9794452a6445 |
12 | b6a9112aa5629 |
13 | 4577ab21c1993 |
14 | 1b6ad769d0c6d |
15 | bde77b433996 |
hex | 5ddc69542741 |
103201241311041 has 8 divisors (see below), whose sum is σ = 137686962995520. Its totient is φ = 68758173583632.
The previous prime is 103201241311019. The next prime is 103201241311153. The reversal of 103201241311041 is 140113142102301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103201241311041 - 26 = 103201241310977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103201241311001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10663483621 + ... + 10663493298.
It is an arithmetic number, because the mean of its divisors is an integer number (17210870374440).
Almost surely, 2103201241311041 is an apocalyptic number.
It is an amenable number.
103201241311041 is a deficient number, since it is larger than the sum of its proper divisors (34485721684479).
103201241311041 is a wasteful number, since it uses less digits than its factorization.
103201241311041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21326978535.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 103201241311041 its reverse (140113142102301), we get a palindrome (243314383413342).
The spelling of 103201241311041 in words is "one hundred three trillion, two hundred one billion, two hundred forty-one million, three hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •