Base | Representation |
---|---|
bin | 11001111101110001111111… |
… | …00110011110100001100011 |
3 | 21111011112212001002222221112 |
4 | 30332320333212132201203 |
5 | 24440444421221043011 |
6 | 321234343040013535 |
7 | 15012135434334110 |
oct | 1476707746364143 |
9 | 244145761088845 |
10 | 57098362284131 |
11 | 17214308a5a343 |
12 | 64a20660012ab |
13 | 25b247747b29c |
14 | 101580b18d907 |
15 | 6903d58e958b |
hex | 33ee3f99e863 |
57098362284131 has 8 divisors (see below), whose sum is σ = 65259897031680. Its totient is φ = 48937983999048.
The previous prime is 57098362284127. The next prime is 57098362284143. The reversal of 57098362284131 is 13148226389075.
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 57098362284131 - 22 = 57098362284127 is a prime.
It is a super-2 number, since 2×570983622841312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57098362284101) 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, 289009811 + ... + 289207308.
It is an arithmetic number, because the mean of its divisors is an integer number (8157487128960).
It is a 1-persistent number, because it is pandigital, but 2⋅57098362284131 = 114196724568262 is not.
Almost surely, 257098362284131 is an apocalyptic number.
57098362284131 is a deficient number, since it is larger than the sum of its proper divisors (8161534747549).
57098362284131 is a wasteful number, since it uses less digits than its factorization.
57098362284131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578231233.
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 57098362284131 in words is "fifty-seven trillion, ninety-eight billion, three hundred sixty-two million, two hundred eighty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •