Base | Representation |
---|---|
bin | 110000000001110110… |
… | …010011111001101101 |
3 | 11221010001020001001022 |
4 | 300001312103321231 |
5 | 1321104034401221 |
6 | 35405145223525 |
7 | 3503653024550 |
oct | 600166237155 |
9 | 157101201038 |
10 | 51570622061 |
11 | 1a9642a9712 |
12 | 9bb2a91ba5 |
13 | 4b2b28a9aa |
14 | 26d3178697 |
15 | 151c6de4ab |
hex | c01d93e6d |
51570622061 has 4 divisors (see below), whose sum is σ = 58937853792. Its totient is φ = 44203390332.
The previous prime is 51570622031. The next prime is 51570622109. The reversal of 51570622061 is 16022607515.
51570622061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16022607515 = 5 ⋅3204521503.
It is a cyclic number.
It is not a de Polignac number, because 51570622061 - 214 = 51570605677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51570622031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3683615855 + ... + 3683615868.
It is an arithmetic number, because the mean of its divisors is an integer number (14734463448).
Almost surely, 251570622061 is an apocalyptic number.
It is an amenable number.
51570622061 is a deficient number, since it is larger than the sum of its proper divisors (7367231731).
51570622061 is an equidigital number, since it uses as much as digits as its factorization.
51570622061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7367231730.
The product of its (nonzero) digits is 25200, while the sum is 35.
The spelling of 51570622061 in words is "fifty-one billion, five hundred seventy million, six hundred twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •