Base | Representation |
---|---|
bin | 1010101001111011101001… |
… | …1101100001010001110100 |
3 | 1112110222202121212211001102 |
4 | 2222132322131201101310 |
5 | 3013421323023214402 |
6 | 40530010035545232 |
7 | 2316263053630604 |
oct | 252367235412164 |
9 | 45428677784042 |
10 | 11715504116852 |
11 | 3807576719018 |
12 | 139266275b218 |
13 | 66c9c89a3c23 |
14 | 2c7067a08c04 |
15 | 154b31954102 |
hex | aa7ba761474 |
11715504116852 has 12 divisors (see below), whose sum is σ = 20502170944836. Its totient is φ = 5857740989760.
The previous prime is 11715504116843. The next prime is 11715504116857. The reversal of 11715504116852 is 25861140551711.
It can be written as a sum of positive squares in 2 ways, for example, as 6447313192336 + 5268190924516 = 2539156^2 + 2295254^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11715504116797 and 11715504116806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11715504116857) 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 3 ways as a sum of consecutive naturals, for example, 100049 + ... + 4841592.
It is an arithmetic number, because the mean of its divisors is an integer number (1708514245403).
Almost surely, 211715504116852 is an apocalyptic number.
It is an amenable number.
11715504116852 is a deficient number, since it is larger than the sum of its proper divisors (8786666827984).
11715504116852 is a wasteful number, since it uses less digits than its factorization.
11715504116852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5534338 (or 5534336 counting only the distinct ones).
The product of its (nonzero) digits is 336000, while the sum is 47.
The spelling of 11715504116852 in words is "eleven trillion, seven hundred fifteen billion, five hundred four million, one hundred sixteen thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •