Base | Representation |
---|---|
bin | 1010011011010111110010… |
… | …1101101001000101000110 |
3 | 1111121002002122200201212021 |
4 | 2212311330231221011012 |
5 | 3000322024133140200 |
6 | 40215040320313354 |
7 | 2262226211312365 |
oct | 246657455510506 |
9 | 44532078621767 |
10 | 11465360052550 |
11 | 3720482937168 |
12 | 1352091a7285a |
13 | 652242b13ab1 |
14 | 2b8cd80157dc |
15 | 14d39117e41a |
hex | a6d7cb69146 |
11465360052550 has 12 divisors (see below), whose sum is σ = 21325569697836. Its totient is φ = 4586144021000.
The previous prime is 11465360052547. The next prime is 11465360052563. The reversal of 11465360052550 is 5525006356411.
It is a happy number.
It is a super-2 number, since 2×114653600525502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11465360052497 and 11465360052506.
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 5 ways as a sum of consecutive naturals, for example, 114653600476 + ... + 114653600575.
It is an arithmetic number, because the mean of its divisors is an integer number (1777130808153).
Almost surely, 211465360052550 is an apocalyptic number.
11465360052550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11465360052550 is a deficient number, since it is larger than the sum of its proper divisors (9860209645286).
11465360052550 is a wasteful number, since it uses less digits than its factorization.
11465360052550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229307201063 (or 229307201058 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 43.
The spelling of 11465360052550 in words is "eleven trillion, four hundred sixty-five billion, three hundred sixty million, fifty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •