Base | Representation |
---|---|
bin | 11110100111000… |
… | …00110000000000 |
3 | 122220011102111120 |
4 | 33103200300000 |
5 | 1011213214440 |
6 | 41251312240 |
7 | 6235351452 |
oct | 1723406000 |
9 | 586142446 |
10 | 256773120 |
11 | 121a3a49a |
12 | 71bab680 |
13 | 41274576 |
14 | 261602d2 |
15 | 17820dd0 |
hex | f4e0c00 |
256773120 has 176 divisors, whose sum is σ = 836158560. Its totient is φ = 67239936.
The previous prime is 256773109. The next prime is 256773131. The reversal of 256773120 is 21377652.
It is an interprime number because it is at equal distance from previous prime (256773109) and next prime (256773131).
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
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, 1121166 + ... + 1121394.
Almost surely, 2256773120 is an apocalyptic number.
256773120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 256773120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (418079280).
256773120 is an abundant number, since it is smaller than the sum of its proper divisors (579385440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256773120 is a wasteful number, since it uses less digits than its factorization.
256773120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 256773120 is about 16024.1417866917. The cubic root of 256773120 is about 635.5989719002.
The spelling of 256773120 in words is "two hundred fifty-six million, seven hundred seventy-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •