Base | Representation |
---|---|
bin | 1110111101110101001… |
… | …1111010010010111000 |
3 | 220120122212012220001012 |
4 | 3233131103322102320 |
5 | 13203033202222322 |
6 | 314041213213052 |
7 | 24401401255646 |
oct | 3573523722270 |
9 | 816585186035 |
10 | 257116054712 |
11 | 9a051345500 |
12 | 419b7791188 |
13 | 1b32743a05a |
14 | c63193c196 |
15 | 6a4c909ae2 |
hex | 3bdd4fa4b8 |
257116054712 has 48 divisors (see below), whose sum is σ = 535150211400. Its totient is φ = 115713752000.
The previous prime is 257116054691. The next prime is 257116054717. The reversal of 257116054712 is 217450611752.
It is a super-2 number, since 2×2571160547122 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 257116054712.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (257116054717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1217162 + ... + 1412697.
Almost surely, 2257116054712 is an apocalyptic number.
257116054712 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
257116054712 is an abundant number, since it is smaller than the sum of its proper divisors (278034156688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
257116054712 is a wasteful number, since it uses less digits than its factorization.
257116054712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2629988 (or 2629973 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 41.
The spelling of 257116054712 in words is "two hundred fifty-seven billion, one hundred sixteen million, fifty-four thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •