Base | Representation |
---|---|
bin | 1011111100001001001100… |
… | …1011011110001101010100 |
3 | 1201111000101011210211220121 |
4 | 2333002103023132031110 |
5 | 3210041404131032034 |
6 | 43530511420241324 |
7 | 2523313223006206 |
oct | 277022313361524 |
9 | 51430334724817 |
10 | 13127889314644 |
11 | 4201563302765 |
12 | 15803336a0244 |
13 | 742c544a05b0 |
14 | 335571062776 |
15 | 17b7470721b4 |
hex | bf0932de354 |
13127889314644 has 48 divisors (see below), whose sum is σ = 26941222022400. Its totient is φ = 5542194220416.
The previous prime is 13127889314641. The next prime is 13127889314677. The reversal of 13127889314644 is 44641398872131.
It is a happy number.
It is a super-2 number, since 2×131278893146442 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13127889314641) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 229063372 + ... + 229120675.
It is an arithmetic number, because the mean of its divisors is an integer number (561275458800).
Almost surely, 213127889314644 is an apocalyptic number.
It is an amenable number.
13127889314644 is an abundant number, since it is smaller than the sum of its proper divisors (13813332707756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13127889314644 is a wasteful number, since it uses less digits than its factorization.
13127889314644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458184112 (or 458184110 counting only the distinct ones).
The product of its digits is 27869184, while the sum is 61.
The spelling of 13127889314644 in words is "thirteen trillion, one hundred twenty-seven billion, eight hundred eighty-nine million, three hundred fourteen thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •