Base | Representation |
---|---|
bin | 1110111100011100000… |
… | …1011001100110001001 |
3 | 220112200210120012022211 |
4 | 3233013001121212021 |
5 | 13201301434302213 |
6 | 313540134145121 |
7 | 24356210604664 |
oct | 3570701314611 |
9 | 815623505284 |
10 | 256742103433 |
11 | 9997a251362 |
12 | 419124b21a1 |
13 | 1b297b190ca |
14 | c5d7dd86db |
15 | 6a29b8e53d |
hex | 3bc7059989 |
256742103433 has 8 divisors (see below), whose sum is σ = 258190653600. Its totient is φ = 255293711808.
The previous prime is 256742103349. The next prime is 256742103437. The reversal of 256742103433 is 334301247652.
256742103433 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 a cyclic number.
It is not a de Polignac number, because 256742103433 - 213 = 256742095241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (256742103437) 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 7 ways as a sum of consecutive naturals, for example, 5015713 + ... + 5066641.
It is an arithmetic number, because the mean of its divisors is an integer number (32273831700).
Almost surely, 2256742103433 is an apocalyptic number.
It is an amenable number.
256742103433 is a deficient number, since it is larger than the sum of its proper divisors (1448550167).
256742103433 is a wasteful number, since it uses less digits than its factorization.
256742103433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79271.
The product of its (nonzero) digits is 362880, while the sum is 40.
The spelling of 256742103433 in words is "two hundred fifty-six billion, seven hundred forty-two million, one hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •