Base | Representation |
---|---|
bin | 11110101000111… |
… | …10001111111111 |
3 | 122220122020001022 |
4 | 33110132033333 |
5 | 1011244300043 |
6 | 41300534355 |
7 | 6240451043 |
oct | 1724361777 |
9 | 586566038 |
10 | 257025023 |
11 | 1220a1782 |
12 | 720b13bb |
13 | 41332118 |
14 | 261c8023 |
15 | 17870868 |
hex | f51e3ff |
257025023 has 16 divisors (see below), whose sum is σ = 290920896. Its totient is φ = 225730560.
The previous prime is 257025019. The next prime is 257025029. The reversal of 257025023 is 320520752.
It is a Cunningham number, because it is equal to 160322-1.
It is a cyclic number.
It is not a de Polignac number, because 257025023 - 22 = 257025019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 257024983 and 257025001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (257025029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8015 + ... + 24047.
It is an arithmetic number, because the mean of its divisors is an integer number (18182556).
Almost surely, 2257025023 is an apocalyptic number.
257025023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
257025023 is a deficient number, since it is larger than the sum of its proper divisors (33895873).
257025023 is a wasteful number, since it uses less digits than its factorization.
257025023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16114.
The product of its (nonzero) digits is 4200, while the sum is 26.
The square root of 257025023 is about 16031.9999688124. Note that the first 4 decimals coincide. The cubic root of 257025023 is about 635.8067519030.
Adding to 257025023 its reverse (320520752), we get a palindrome (577545775).
The spelling of 257025023 in words is "two hundred fifty-seven million, twenty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •