Base | Representation |
---|---|
bin | 11110100110011… |
… | …01110101001110 |
3 | 122220000111012120 |
4 | 33103031311032 |
5 | 1011203230010 |
6 | 41245513410 |
7 | 6234606522 |
oct | 1723156516 |
9 | 586014176 |
10 | 256695630 |
11 | 121997254 |
12 | 71b72866 |
13 | 41248209 |
14 | 2613dd82 |
15 | 17807e70 |
hex | f4cdd4e |
256695630 has 16 divisors (see below), whose sum is σ = 616069584. Its totient is φ = 68452160.
The previous prime is 256695619. The next prime is 256695653. The reversal of 256695630 is 36596652.
256695630 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2566956302 = 131785292922193800, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4278231 + ... + 4278290.
It is an arithmetic number, because the mean of its divisors is an integer number (38504349).
Almost surely, 2256695630 is an apocalyptic number.
256695630 is an abundant number, since it is smaller than the sum of its proper divisors (359373954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256695630 is a wasteful number, since it uses less digits than its factorization.
256695630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8556531.
The product of its (nonzero) digits is 291600, while the sum is 42.
The square root of 256695630 is about 16021.7236900403. The cubic root of 256695630 is about 635.5350276164.
The spelling of 256695630 in words is "two hundred fifty-six million, six hundred ninety-five thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •