Base | Representation |
---|---|
bin | 1010010010111011111101… |
… | …1111011101101111111100 |
3 | 1111002020001201201122101222 |
4 | 2210232333133131233330 |
5 | 2440433241042142112 |
6 | 40024313231452512 |
7 | 2245606225160126 |
oct | 244567737355774 |
9 | 44066051648358 |
10 | 11320451521532 |
11 | 3674a8184001a |
12 | 1329b90387138 |
13 | 64168b33a99a |
14 | 2b1cac936216 |
15 | 14970e573372 |
hex | a4bbf7ddbfc |
11320451521532 has 12 divisors (see below), whose sum is σ = 19904680164936. Its totient is φ = 5633400045840.
The previous prime is 11320451521517. The next prime is 11320451521573. The reversal of 11320451521532 is 23512515402311.
It is a junction number, because it is equal to n+sod(n) for n = 11320451521492 and 11320451521501.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6706427783 + ... + 6706429470.
It is an arithmetic number, because the mean of its divisors is an integer number (1658723347078).
Almost surely, 211320451521532 is an apocalyptic number.
It is an amenable number.
11320451521532 is a deficient number, since it is larger than the sum of its proper divisors (8584228643404).
11320451521532 is a wasteful number, since it uses less digits than its factorization.
11320451521532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13412857468 (or 13412857466 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 11320451521532 its reverse (23512515402311), we get a palindrome (34832966923843).
The spelling of 11320451521532 in words is "eleven trillion, three hundred twenty billion, four hundred fifty-one million, five hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •