Base | Representation |
---|---|
bin | 1011010101010101010001… |
… | …0111000011000001101110 |
3 | 1122010021022120011012010221 |
4 | 2311111110113003001232 |
5 | 3113130331024003200 |
6 | 42300320222321554 |
7 | 2424200025466261 |
oct | 265252427030156 |
9 | 48107276135127 |
10 | 12461115453550 |
11 | 3a748028a3aa5 |
12 | 149306a4292ba |
13 | 6c51028b999a |
14 | 31119a836cd8 |
15 | 16921ee5691a |
hex | b55545c306e |
12461115453550 has 48 divisors (see below), whose sum is σ = 23871533342832. Its totient is φ = 4835992550400.
The previous prime is 12461115453529. The next prime is 12461115453571. The reversal of 12461115453550 is 5535451116421.
It is an interprime number because it is at equal distance from previous prime (12461115453529) and next prime (12461115453571).
It is a junction number, because it is equal to n+sod(n) for n = 12461115453497 and 12461115453506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8887656 + ... + 10193755.
It is an arithmetic number, because the mean of its divisors is an integer number (497323611309).
Almost surely, 212461115453550 is an apocalyptic number.
12461115453550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12461115453550 is a deficient number, since it is larger than the sum of its proper divisors (11410417889282).
12461115453550 is a wasteful number, since it uses less digits than its factorization.
12461115453550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19081813 (or 19081808 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 43.
Adding to 12461115453550 its reverse (5535451116421), we get a palindrome (17996566569971).
The spelling of 12461115453550 in words is "twelve trillion, four hundred sixty-one billion, one hundred fifteen million, four hundred fifty-three thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •