Base | Representation |
---|---|
bin | 10111101111110100100110… |
… | …01011110011110000111011 |
3 | 20211220020201002121121011020 |
4 | 23313322103023303300323 |
5 | 23321040424010344011 |
6 | 303021503333433523 |
7 | 13666551113612334 |
oct | 1367722313636073 |
9 | 224806632547136 |
10 | 52220681731131 |
11 | 157037374a0851 |
12 | 5a3487479b8a3 |
13 | 231a509c95034 |
14 | cc76ccc0128b |
15 | 6085a6ae2006 |
hex | 2f7e932f3c3b |
52220681731131 has 8 divisors (see below), whose sum is σ = 69634062927120. Its totient is φ = 34810544177952.
The previous prime is 52220681731079. The next prime is 52220681731177. The reversal of 52220681731131 is 13113718602225.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52220681731131 - 219 = 52220681206843 is a prime.
It is a super-2 number, since 2×522206817311312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52220681771131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 810873136 + ... + 810937533.
It is an arithmetic number, because the mean of its divisors is an integer number (8704257865890).
Almost surely, 252220681731131 is an apocalyptic number.
52220681731131 is a deficient number, since it is larger than the sum of its proper divisors (17413381195989).
52220681731131 is a wasteful number, since it uses less digits than its factorization.
52220681731131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1621821405.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 52220681731131 in words is "fifty-two trillion, two hundred twenty billion, six hundred eighty-one million, seven hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •