Base | Representation |
---|---|
bin | 111000100100011001001… |
… | …000001111100011000000 |
3 | 111202121222021211011111111 |
4 | 320210121020033203000 |
5 | 1002142311422302422 |
6 | 12133455353453104 |
7 | 550565402153500 |
oct | 70443110174300 |
9 | 14677867734444 |
10 | 3887366994112 |
11 | 1269694363238 |
12 | 529493411194 |
13 | 222766c706a4 |
14 | d62145a5a00 |
15 | 6b1bcb62a77 |
hex | 3891920f8c0 |
3887366994112 has 672 divisors, whose sum is σ = 10108933401600. Its totient is φ = 1472106037248.
The previous prime is 3887366994103. The next prime is 3887366994143. The reversal of 3887366994112 is 2114996637883.
It is a super-4 number, since 4×38873669941124 (a number of 51 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 8396040793 + ... + 8396041255.
Almost surely, 23887366994112 is an apocalyptic number.
3887366994112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3887366994112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5054466700800).
3887366994112 is an abundant number, since it is smaller than the sum of its proper divisors (6221566407488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3887366994112 is a wasteful number, since it uses less digits than its factorization.
3887366994112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693 (or 676 counting only the distinct ones).
The product of its digits is 94058496, while the sum is 67.
The spelling of 3887366994112 in words is "three trillion, eight hundred eighty-seven billion, three hundred sixty-six million, nine hundred ninety-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •