Base | Representation |
---|---|
bin | 111010111101000111010… |
… | …001010001000010011101 |
3 | 112100022020112112022022002 |
4 | 322331013101101002131 |
5 | 1012334131031244301 |
6 | 12341055303532045 |
7 | 565462140456122 |
oct | 72750721210235 |
9 | 15308215468262 |
10 | 4051349868701 |
11 | 1322193422a93 |
12 | 555218a5a025 |
13 | 23506b413b25 |
14 | 10012d052749 |
15 | 705b90e116b |
hex | 3af4745109d |
4051349868701 has 8 divisors (see below), whose sum is σ = 4145772807264. Its totient is φ = 3956936271120.
The previous prime is 4051349868679. The next prime is 4051349868707. The reversal of 4051349868701 is 1078689431504.
It is a happy number.
4051349868701 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 a de Polignac number, because none of the positive numbers 2k-4051349868701 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4051349868707) 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, 1453871 + ... + 3196316.
It is an arithmetic number, because the mean of its divisors is an integer number (518221600908).
Almost surely, 24051349868701 is an apocalyptic number.
It is an amenable number.
4051349868701 is a deficient number, since it is larger than the sum of its proper divisors (94422938563).
4051349868701 is a wasteful number, since it uses less digits than its factorization.
4051349868701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4670491.
The product of its (nonzero) digits is 5806080, while the sum is 56.
The spelling of 4051349868701 in words is "four trillion, fifty-one billion, three hundred forty-nine million, eight hundred sixty-eight thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •