Base | Representation |
---|---|
bin | 101000110000100000010… |
… | …1010011001101100110001 |
3 | 201211112000122121120102111 |
4 | 1101201000222121230301 |
5 | 1213234311341223441 |
6 | 15525221243445321 |
7 | 1115465620110631 |
oct | 121410052315461 |
9 | 21745018546374 |
10 | 5601722211121 |
11 | 186a74a173833 |
12 | 765799526841 |
13 | 3183177769ba |
14 | 1551a66546c1 |
15 | 9aaa887e081 |
hex | 51840a99b31 |
5601722211121 has 8 divisors (see below), whose sum is σ = 5624181549504. Its totient is φ = 5579263998000.
The previous prime is 5601722211023. The next prime is 5601722211133. The reversal of 5601722211121 is 1211122271065.
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 5601722211121 - 27 = 5601722210993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5601722211161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10525011 + ... + 11044423.
It is an arithmetic number, because the mean of its divisors is an integer number (703022693688).
Almost surely, 25601722211121 is an apocalyptic number.
It is an amenable number.
5601722211121 is a deficient number, since it is larger than the sum of its proper divisors (22459338383).
5601722211121 is a wasteful number, since it uses less digits than its factorization.
5601722211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562631.
The product of its (nonzero) digits is 3360, while the sum is 31.
Adding to 5601722211121 its reverse (1211122271065), we get a palindrome (6812844482186).
The spelling of 5601722211121 in words is "five trillion, six hundred one billion, seven hundred twenty-two million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •