Base | Representation |
---|---|
bin | 111101111100011001001… |
… | …001001110101100101001 |
3 | 120001221101010211120022202 |
4 | 331330121021032230221 |
5 | 1024220243004041413 |
6 | 13015303344025545 |
7 | 616352563513322 |
oct | 75743111165451 |
9 | 16057333746282 |
10 | 4256734440233 |
11 | 13a12a8689500 |
12 | 588b979022b5 |
13 | 24b5401607b2 |
14 | 10a054301449 |
15 | 75ada133e58 |
hex | 3df1924eb29 |
4256734440233 has 12 divisors (see below), whose sum is σ = 4678940314944. Its totient is φ = 3869716903800.
The previous prime is 4256734440209. The next prime is 4256734440241. The reversal of 4256734440233 is 3320444376524.
4256734440233 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4256734440233 - 28 = 4256734439977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4256734440263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19589660 + ... + 19805762.
It is an arithmetic number, because the mean of its divisors is an integer number (389911692912).
Almost surely, 24256734440233 is an apocalyptic number.
It is an amenable number.
4256734440233 is a deficient number, since it is larger than the sum of its proper divisors (422205874711).
4256734440233 is a wasteful number, since it uses less digits than its factorization.
4256734440233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378916 (or 378905 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 47.
The spelling of 4256734440233 in words is "four trillion, two hundred fifty-six billion, seven hundred thirty-four million, four hundred forty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •