Base | Representation |
---|---|
bin | 111011111101101110100… |
… | …101000001011001011111 |
3 | 112120221022200022000000122 |
4 | 323331232211001121133 |
5 | 1020003223040220204 |
6 | 12433011531545155 |
7 | 603466334115641 |
oct | 73755645013137 |
9 | 15527280260018 |
10 | 4120728835679 |
11 | 1349656000825 |
12 | 56675b8bb1bb |
13 | 23b776caa201 |
14 | 1036313a8891 |
15 | 722c9e2c0be |
hex | 3bf6e94165f |
4120728835679 has 8 divisors (see below), whose sum is σ = 4125460953600. Its totient is φ = 4115997135576.
The previous prime is 4120728835673. The next prime is 4120728835687. The reversal of 4120728835679 is 9765388270214.
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-4120728835679 is a prime.
It is a super-2 number, since 2×41207288356792 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4120728835673) 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, 22401092 + ... + 22584294.
It is an arithmetic number, because the mean of its divisors is an integer number (515682619200).
It is a 1-persistent number, because it is pandigital, but 2⋅4120728835679 = 8241457671358 is not.
Almost surely, 24120728835679 is an apocalyptic number.
4120728835679 is a deficient number, since it is larger than the sum of its proper divisors (4732117921).
4120728835679 is a wasteful number, since it uses less digits than its factorization.
4120728835679 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208909.
The product of its (nonzero) digits is 40642560, while the sum is 62.
The spelling of 4120728835679 in words is "four trillion, one hundred twenty billion, seven hundred twenty-eight million, eight hundred thirty-five thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •