Base | Representation |
---|---|
bin | 1010100100011101000000… |
… | …1111101101011111111100 |
3 | 1112010222210222100021110001 |
4 | 2221013100033231133330 |
5 | 3010401041330041012 |
6 | 40414442144124044 |
7 | 2306421431543530 |
oct | 251072017553774 |
9 | 45128728307401 |
10 | 11621380315132 |
11 | 3780666245735 |
12 | 1378374906624 |
13 | 663b78704ab3 |
14 | 2c269916bbc0 |
15 | 15247354a357 |
hex | a91d03ed7fc |
11621380315132 has 72 divisors (see below), whose sum is σ = 24049518890208. Its totient is φ = 4813343533440.
The previous prime is 11621380315099. The next prime is 11621380315183. The reversal of 11621380315132 is 23151308312611.
It is a junction number, because it is equal to n+sod(n) for n = 11621380315091 and 11621380315100.
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, 19428958 + ... + 20018170.
Almost surely, 211621380315132 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11621380315132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12024759445104).
11621380315132 is an abundant number, since it is smaller than the sum of its proper divisors (12428138575076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11621380315132 is a wasteful number, since it uses less digits than its factorization.
11621380315132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590019 (or 589986 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
Adding to 11621380315132 its reverse (23151308312611), we get a palindrome (34772688627743).
The spelling of 11621380315132 in words is "eleven trillion, six hundred twenty-one billion, three hundred eighty million, three hundred fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •