Base | Representation |
---|---|
bin | 11110100110011… |
… | …11001011000101 |
3 | 122220000202202002 |
4 | 33103033023011 |
5 | 1011203414000 |
6 | 41245555045 |
7 | 6234631532 |
oct | 1723171305 |
9 | 586022662 |
10 | 256701125 |
11 | 1219a039a |
12 | 71b75a85 |
13 | 4124a875 |
14 | 26141d89 |
15 | 178098d5 |
hex | f4cf2c5 |
256701125 has 16 divisors (see below), whose sum is σ = 320816496. Its totient is φ = 205070400.
The previous prime is 256701119. The next prime is 256701131. The reversal of 256701125 is 521107652.
It is an interprime number because it is at equal distance from previous prime (256701119) and next prime (256701131).
It can be written as a sum of positive squares in 8 ways, for example, as 171452836 + 85248289 = 13094^2 + 9233^2 .
It is not a de Polignac number, because 256701125 - 26 = 256701061 is a prime.
It is a Duffinian number.
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, 150779 + ... + 152471.
It is an arithmetic number, because the mean of its divisors is an integer number (20051031).
Almost surely, 2256701125 is an apocalyptic number.
256701125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
256701125 is a deficient number, since it is larger than the sum of its proper divisors (64115371).
256701125 is a wasteful number, since it uses less digits than its factorization.
256701125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2921 (or 2911 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 29.
The square root of 256701125 is about 16021.8951750409. The cubic root of 256701125 is about 635.5395624814.
Adding to 256701125 its reverse (521107652), we get a palindrome (777808777).
The spelling of 256701125 in words is "two hundred fifty-six million, seven hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •