Base | Representation |
---|---|
bin | 11110100011000… |
… | …10011110001001 |
3 | 122212012010222120 |
4 | 33101202132021 |
5 | 1011100142011 |
6 | 41232241453 |
7 | 6231065460 |
oct | 1721423611 |
9 | 585163876 |
10 | 256255881 |
11 | 121716922 |
12 | 719a0289 |
13 | 41122ccb |
14 | 260679d7 |
15 | 1776ca06 |
hex | f462789 |
256255881 has 8 divisors (see below), whose sum is σ = 390485184. Its totient is φ = 146431920.
The previous prime is 256255873. The next prime is 256255921. The reversal of 256255881 is 188552652.
256255881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 256255881 - 23 = 256255873 is a prime.
It is a super-2 number, since 2×2562558812 = 131334153094172322, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (256255801) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6101310 + ... + 6101351.
It is an arithmetic number, because the mean of its divisors is an integer number (48810648).
Almost surely, 2256255881 is an apocalyptic number.
256255881 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
256255881 is a deficient number, since it is larger than the sum of its proper divisors (134229303).
256255881 is a wasteful number, since it uses less digits than its factorization.
256255881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12202671.
The product of its digits is 192000, while the sum is 42.
The square root of 256255881 is about 16007.9942841069. The cubic root of 256255881 is about 635.1719054286.
The spelling of 256255881 in words is "two hundred fifty-six million, two hundred fifty-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •