Base | Representation |
---|---|
bin | 111100011000111001101… |
… | …011011011111110000000 |
3 | 112200201122002110101201210 |
4 | 330120321223123332000 |
5 | 1020443001430033000 |
6 | 12454235053530120 |
7 | 605551353541560 |
oct | 74307153337600 |
9 | 15621562411653 |
10 | 4149906096000 |
11 | 135aa68892305 |
12 | 5703431a3940 |
13 | 241446a89ca2 |
14 | 104bdc448da0 |
15 | 72e366db350 |
hex | 3c639adbf80 |
4149906096000 has 256 divisors, whose sum is σ = 15722216939520. Its totient is φ = 948549888000.
The previous prime is 4149906095941. The next prime is 4149906096013. The reversal of 4149906096000 is 6906099414.
It is a super-2 number, since 2×41499060960002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5839456 + ... + 6511455.
It is an arithmetic number, because the mean of its divisors is an integer number (61414909920).
Almost surely, 24149906096000 is an apocalyptic number.
4149906096000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4149906096000 is an abundant number, since it is smaller than the sum of its proper divisors (11572310843520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4149906096000 is a wasteful number, since it uses less digits than its factorization.
4149906096000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12350950 (or 12350928 counting only the distinct ones).
The product of its (nonzero) digits is 419904, while the sum is 48.
The spelling of 4149906096000 in words is "four trillion, one hundred forty-nine billion, nine hundred six million, ninety-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •