Base | Representation |
---|---|
bin | 111010011001000101010… |
… | …101100100011110011100 |
3 | 112012121101100212101020212 |
4 | 322121011111210132130 |
5 | 1011220413130034141 |
6 | 12311220344231552 |
7 | 562622344332110 |
oct | 72310525443634 |
9 | 15177340771225 |
10 | 4012662736796 |
11 | 13078405611aa |
12 | 54982076b5b8 |
13 | 2315143536bc |
14 | dc2dcd95740 |
15 | 6e5a29dc2eb |
hex | 3a64556479c |
4012662736796 has 48 divisors (see below), whose sum is σ = 8374470322176. Its totient is φ = 1644899735424.
The previous prime is 4012662736783. The next prime is 4012662736829. The reversal of 4012662736796 is 6976372662104.
4012662736796 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×40126627367962 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40475480 + ... + 40574496.
It is an arithmetic number, because the mean of its divisors is an integer number (174468131712).
Almost surely, 24012662736796 is an apocalyptic number.
4012662736796 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
It is an amenable number.
4012662736796 is an abundant number, since it is smaller than the sum of its proper divisors (4361807585380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4012662736796 is a wasteful number, since it uses less digits than its factorization.
4012662736796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161978 (or 161976 counting only the distinct ones).
The product of its (nonzero) digits is 27433728, while the sum is 59.
The spelling of 4012662736796 in words is "four trillion, twelve billion, six hundred sixty-two million, seven hundred thirty-six thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •