Base | Representation |
---|---|
bin | 111010011100111101010110… |
… | …001100100001101000011100 |
3 | 1020201020021221011222021200010 |
4 | 322130331112030201220130 |
5 | 232143421102142014030 |
6 | 2310431224543403220 |
7 | 105102115421256642 |
oct | 7234752614415034 |
9 | 1221207834867603 |
10 | 257076713626140 |
11 | 74a04692958501 |
12 | 249bb2332b3510 |
13 | b05a2cb621165 |
14 | 476a81796d192 |
15 | 1eac24e10b6b0 |
hex | e9cf56321a1c |
257076713626140 has 48 divisors (see below), whose sum is σ = 719828213293728. Its totient is φ = 68552512667904.
The previous prime is 257076713626111. The next prime is 257076713626153. The reversal of 257076713626140 is 41626317670752.
257076713626140 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36677587 + ... + 43120746.
It is an arithmetic number, because the mean of its divisors is an integer number (14996421110286).
Almost surely, 2257076713626140 is an apocalyptic number.
257076713626140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
257076713626140 is an abundant number, since it is smaller than the sum of its proper divisors (462751499667588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
257076713626140 is a wasteful number, since it uses less digits than its factorization.
257076713626140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79852038 (or 79852036 counting only the distinct ones).
The product of its (nonzero) digits is 17781120, while the sum is 57.
The spelling of 257076713626140 in words is "two hundred fifty-seven trillion, seventy-six billion, seven hundred thirteen million, six hundred twenty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •