Base | Representation |
---|---|
bin | 11110100011000… |
… | …11111111011101 |
3 | 122212012110112020 |
4 | 33101203333131 |
5 | 1011100341414 |
6 | 41232330353 |
7 | 6231122565 |
oct | 1721437735 |
9 | 585173466 |
10 | 256262109 |
11 | 121720574 |
12 | 719a39b9 |
13 | 41125aac |
14 | 26069da5 |
15 | 1776e7a9 |
hex | f463fdd |
256262109 has 4 divisors (see below), whose sum is σ = 341682816. Its totient is φ = 170841404.
The previous prime is 256262107. The next prime is 256262117. The reversal of 256262109 is 901262652.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 256262109 - 21 = 256262107 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 256262109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256262107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42710349 + ... + 42710354.
It is an arithmetic number, because the mean of its divisors is an integer number (85420704).
Almost surely, 2256262109 is an apocalyptic number.
It is an amenable number.
256262109 is a deficient number, since it is larger than the sum of its proper divisors (85420707).
256262109 is an equidigital number, since it uses as much as digits as its factorization.
256262109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85420706.
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 256262109 is about 16008.1888107306. The cubic root of 256262109 is about 635.1770510908.
The spelling of 256262109 in words is "two hundred fifty-six million, two hundred sixty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •