Base | Representation |
---|---|
bin | 1100101000000010010101… |
… | …0101101110001100000000 |
3 | 1211011002202201020212011210 |
4 | 3022000211111232030000 |
5 | 3304420223423024442 |
6 | 45305141300210120 |
7 | 2631636633322653 |
oct | 312004525561400 |
9 | 54132681225153 |
10 | 13881960751872 |
11 | 4472340a40464 |
12 | 1682500699940 |
13 | 7990a90516b5 |
14 | 35dc676c589a |
15 | 19117d15619c |
hex | ca02556e300 |
13881960751872 has 144 divisors (see below), whose sum is σ = 37041559252992. Its totient is φ = 4615399219200.
The previous prime is 13881960751817. The next prime is 13881960751931. The reversal of 13881960751872 is 27815706918831.
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, 515067997 + ... + 515094947.
It is an arithmetic number, because the mean of its divisors is an integer number (257233050368).
Almost surely, 213881960751872 is an apocalyptic number.
13881960751872 is a gapful number since it is divisible by the number (12) 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 13881960751872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18520779626496).
13881960751872 is an abundant number, since it is smaller than the sum of its proper divisors (23159598501120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13881960751872 is a wasteful number, since it uses less digits than its factorization.
13881960751872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28674 (or 28660 counting only the distinct ones).
The product of its (nonzero) digits is 40642560, while the sum is 66.
The spelling of 13881960751872 in words is "thirteen trillion, eight hundred eighty-one billion, nine hundred sixty million, seven hundred fifty-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •