Base | Representation |
---|---|
bin | 1111110110110111… |
… | …1111110111000101 |
3 | 101222122201110000021 |
4 | 3331231333313011 |
5 | 32204203144301 |
6 | 1542215415141 |
7 | 210325204501 |
oct | 37555776705 |
9 | 11878643007 |
10 | 4256693701 |
11 | 1894879a87 |
12 | 9a96844b1 |
13 | 52ab68a90 |
14 | 2c5493301 |
15 | 19da7c8a1 |
hex | fdb7fdc5 |
4256693701 has 8 divisors (see below), whose sum is σ = 4584798680. Its totient is φ = 3928684032.
The previous prime is 4256693681. The next prime is 4256693713. The reversal of 4256693701 is 1073966524.
4256693701 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 12040900 + 4244652801 = 3470^2 + 65151^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4256693701 - 219 = 4256169413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4256693501) 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, 88621 + ... + 127933.
It is an arithmetic number, because the mean of its divisors is an integer number (573099835).
Almost surely, 24256693701 is an apocalyptic number.
It is an amenable number.
4256693701 is a deficient number, since it is larger than the sum of its proper divisors (328104979).
4256693701 is a wasteful number, since it uses less digits than its factorization.
4256693701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47655.
The product of its (nonzero) digits is 272160, while the sum is 43.
The square root of 4256693701 is about 65243.3421967330. The cubic root of 4256693701 is about 1620.6558464492.
The spelling of 4256693701 in words is "four billion, two hundred fifty-six million, six hundred ninety-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •