Base | Representation |
---|---|
bin | 1100100111101100101010… |
… | …1110000110110001111000 |
3 | 1211010112202102201220211211 |
4 | 3021323022232012301320 |
5 | 3304321321213400404 |
6 | 45302340242132504 |
7 | 2631342551141260 |
oct | 311731256066170 |
9 | 54115672656754 |
10 | 13876145450104 |
11 | 446a9273a1143 |
12 | 1681359051134 |
13 | 798690313132 |
14 | 35d8752347a0 |
15 | 190e3c853b04 |
hex | c9ecab86c78 |
13876145450104 has 64 divisors (see below), whose sum is σ = 30636051042240. Its totient is φ = 5769299727360.
The previous prime is 13876145450093. The next prime is 13876145450113. The reversal of 13876145450104 is 40105454167831.
It is a super-2 number, since 2×138761454501042 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 27573259 + ... + 28071994.
It is an arithmetic number, because the mean of its divisors is an integer number (478688297535).
Almost surely, 213876145450104 is an apocalyptic number.
13876145450104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
13876145450104 is an abundant number, since it is smaller than the sum of its proper divisors (16759905592136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13876145450104 is a wasteful number, since it uses less digits than its factorization.
13876145450104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55645400 (or 55645396 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 49.
The spelling of 13876145450104 in words is "thirteen trillion, eight hundred seventy-six billion, one hundred forty-five million, four hundred fifty thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •