Base | Representation |
---|---|
bin | 11010001100100101101101… |
… | …110011110101011110011100 |
3 | 120002221101100110020002112010 |
4 | 122030211231303311132130 |
5 | 110100132432021120444 |
6 | 1045012423114511220 |
7 | 33160650515424612 |
oct | 3214455563653634 |
9 | 502841313202463 |
10 | 115214340020124 |
11 | 33790144345254 |
12 | 10b09389435510 |
13 | 4c398865642a7 |
14 | 20645920b16b2 |
15 | d4bec92a32b9 |
hex | 68c96dcf579c |
115214340020124 has 48 divisors (see below), whose sum is σ = 278158642715520. Its totient is φ = 37073135467200.
The previous prime is 115214340020113. The next prime is 115214340020147. The reversal of 115214340020124 is 421020043412511.
It is a super-3 number, since 3×1152143400201243 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115214340020091 and 115214340020100.
It is a congruent number.
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, 31015534 + ... + 34531029.
It is an arithmetic number, because the mean of its divisors is an integer number (5794971723240).
Almost surely, 2115214340020124 is an apocalyptic number.
It is an amenable number.
115214340020124 is an abundant number, since it is smaller than the sum of its proper divisors (162944302695396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115214340020124 is a wasteful number, since it uses less digits than its factorization.
115214340020124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65551650 (or 65551648 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 115214340020124 its reverse (421020043412511), we get a palindrome (536234383432635).
The spelling of 115214340020124 in words is "one hundred fifteen trillion, two hundred fourteen billion, three hundred forty million, twenty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •