Base | Representation |
---|---|
bin | 11010010101001001011010… |
… | …10001001100100110010111 |
3 | 21121000022011010111121012012 |
4 | 31022210231101030212113 |
5 | 30042123141140201101 |
6 | 323051241134014435 |
7 | 15124140023042615 |
oct | 1512445521144627 |
9 | 247008133447165 |
10 | 57901213600151 |
11 | 174a3848660a59 |
12 | 65b178734741b |
13 | 26400a40812ac |
14 | 10426100966b5 |
15 | 6a62241b0bbb |
hex | 34a92d44c997 |
57901213600151 has 8 divisors (see below), whose sum is σ = 59902646206800. Its totient is φ = 55900103595840.
The previous prime is 57901213600127. The next prime is 57901213600157. The reversal of 57901213600151 is 15100631210975.
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 57901213600151 - 214 = 57901213583767 is a prime.
It is a super-2 number, since 2×579012136001512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57901213600099 and 57901213600108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57901213600157) 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, 80285390 + ... + 81003371.
It is an arithmetic number, because the mean of its divisors is an integer number (7487830775850).
Almost surely, 257901213600151 is an apocalyptic number.
57901213600151 is a deficient number, since it is larger than the sum of its proper divisors (2001432606649).
57901213600151 is a wasteful number, since it uses less digits than its factorization.
57901213600151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161301169.
The product of its (nonzero) digits is 56700, while the sum is 41.
The spelling of 57901213600151 in words is "fifty-seven trillion, nine hundred one billion, two hundred thirteen million, six hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •