Base | Representation |
---|---|
bin | 111011101011001000010… |
… | …1100010111010110010101 |
3 | 1002001001120001001001001120 |
4 | 1313112100230113112111 |
5 | 2033333203122222031 |
6 | 25235420515314153 |
7 | 1504353212515521 |
oct | 167262054272625 |
9 | 32031501031046 |
10 | 8201520117141 |
11 | 268227732499a |
12 | b056145ab959 |
13 | 476527b2a120 |
14 | 204d545bcd81 |
15 | e3518aa9a96 |
hex | 77590b17595 |
8201520117141 has 16 divisors (see below), whose sum is σ = 11783146709376. Its totient is φ = 5044258587456.
The previous prime is 8201520117113. The next prime is 8201520117151. The reversal of 8201520117141 is 1417110251028.
It is a happy number.
It is not a de Polignac number, because 8201520117141 - 238 = 7926642210197 is a prime.
It is a super-3 number, since 3×82015201171413 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8201520117101) 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 15 ways as a sum of consecutive naturals, for example, 58902810 + ... + 59041883.
It is an arithmetic number, because the mean of its divisors is an integer number (736446669336).
Almost surely, 28201520117141 is an apocalyptic number.
It is an amenable number.
8201520117141 is a deficient number, since it is larger than the sum of its proper divisors (3581626592235).
8201520117141 is a wasteful number, since it uses less digits than its factorization.
8201520117141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117946492.
The product of its (nonzero) digits is 4480, while the sum is 33.
Adding to 8201520117141 its reverse (1417110251028), we get a palindrome (9618630368169).
The spelling of 8201520117141 in words is "eight trillion, two hundred one billion, five hundred twenty million, one hundred seventeen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •