Base | Representation |
---|---|
bin | 111010010010101110110… |
… | …101000011100100000000 |
3 | 112011221210001200202202021 |
4 | 322102232311003210000 |
5 | 1011112431210214210 |
6 | 12304131514331224 |
7 | 562261341555034 |
oct | 72225665034400 |
9 | 15157701622667 |
10 | 4005842663680 |
11 | 130496082a340 |
12 | 548438729b14 |
13 | 2309983c7290 |
14 | dbc532b41c4 |
15 | 6e303db4bda |
hex | 3a4aed43900 |
4005842663680 has 144 divisors (see below), whose sum is σ = 11272735905984. Its totient is φ = 1344618455040.
The previous prime is 4005842663639. The next prime is 4005842663689. The reversal of 4005842663680 is 863662485004.
It is a super-2 number, since 2×40058426636802 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is not an unprimeable number, because it can be changed into a prime (4005842663689) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10759494 + ... + 11125573.
It is an arithmetic number, because the mean of its divisors is an integer number (78282888236).
Almost surely, 24005842663680 is an apocalyptic number.
4005842663680 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4005842663680 is an abundant number, since it is smaller than the sum of its proper divisors (7266893242304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4005842663680 is a wasteful number, since it uses less digits than its factorization.
4005842663680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21885112 (or 21885098 counting only the distinct ones).
The product of its (nonzero) digits is 6635520, while the sum is 52.
The spelling of 4005842663680 in words is "four trillion, five billion, eight hundred forty-two million, six hundred sixty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •