Base | Representation |
---|---|
bin | 1010011110010001111100… |
… | …1110111000100101000000 |
3 | 1111202212002020102221101122 |
4 | 2213210133032320211000 |
5 | 3002131344304103112 |
6 | 40254023054051412 |
7 | 2265645434121245 |
oct | 247443716704500 |
9 | 44685066387348 |
10 | 11515331316032 |
11 | 373a696362025 |
12 | 135b8b91a9b68 |
13 | 656b7793195b |
14 | 2bb4b89c55cc |
15 | 14e818249872 |
hex | a791f3b8940 |
11515331316032 has 28 divisors (see below), whose sum is σ = 23638691983380. Its totient is φ = 5559125462016.
The previous prime is 11515331316031. The next prime is 11515331316043. The reversal of 11515331316032 is 23061313351511.
It can be written as a sum of positive squares in 2 ways, for example, as 8082967419136 + 3432363896896 = 2843056^2 + 1852664^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11515331315983 and 11515331316001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11515331316031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3102188693 + ... + 3102192404.
Almost surely, 211515331316032 is an apocalyptic number.
It is an amenable number.
11515331316032 is an abundant number, since it is smaller than the sum of its proper divisors (12123360667348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11515331316032 is an equidigital number, since it uses as much as digits as its factorization.
11515331316032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6204381138 (or 6204381128 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 35.
Adding to 11515331316032 its reverse (23061313351511), we get a palindrome (34576644667543).
The spelling of 11515331316032 in words is "eleven trillion, five hundred fifteen billion, three hundred thirty-one million, three hundred sixteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •