Base | Representation |
---|---|
bin | 1010100010011001… |
… | …00000100111101011 |
3 | 112121021000121000211 |
4 | 11101030200213223 |
5 | 43041220414011 |
6 | 2333205241551 |
7 | 260122262521 |
oct | 52114404753 |
9 | 15537017024 |
10 | 5657201131 |
11 | 2443384a3a |
12 | 111a7032b7 |
13 | 6c20644ba |
14 | 3b9498311 |
15 | 2319c2b21 |
hex | 1513209eb |
5657201131 has 8 divisors (see below), whose sum is σ = 5794424064. Its totient is φ = 5520235560.
The previous prime is 5657201101. The next prime is 5657201159. The reversal of 5657201131 is 1311027565.
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 5657201131 - 223 = 5648812523 is a prime.
It is a super-2 number, since 2×56572011312 = 64007849273175358322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5657201093 and 5657201102.
It is not an unprimeable number, because it can be changed into a prime (5657201101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19471 + ... + 108136.
It is an arithmetic number, because the mean of its divisors is an integer number (724303008).
Almost surely, 25657201131 is an apocalyptic number.
5657201131 is a deficient number, since it is larger than the sum of its proper divisors (137222933).
5657201131 is a wasteful number, since it uses less digits than its factorization.
5657201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128681.
The product of its (nonzero) digits is 6300, while the sum is 31.
The square root of 5657201131 is about 75214.3678495007. The cubic root of 5657201131 is about 1781.8338558124.
Adding to 5657201131 its reverse (1311027565), we get a palindrome (6968228696).
The spelling of 5657201131 in words is "five billion, six hundred fifty-seven million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •