Base | Representation |
---|---|
bin | 10011011000000011101… |
… | …001101001111100111110 |
3 | 11201021211121020210201121 |
4 | 103120003221221330332 |
5 | 133303403241110100 |
6 | 2455403321501154 |
7 | 165124560502405 |
oct | 23300351517476 |
9 | 4637747223647 |
10 | 1331501113150 |
11 | 4737607367aa |
12 | 1960790417ba |
13 | 98738481370 |
14 | 4863310663c |
15 | 2497e71851a |
hex | 13603a69f3e |
1331501113150 has 24 divisors (see below), whose sum is σ = 2667099154104. Its totient is φ = 491631180000.
The previous prime is 1331501113109. The next prime is 1331501113157. The reversal of 1331501113150 is 513111051331.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331501113157) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1024230976 + ... + 1024232275.
It is an arithmetic number, because the mean of its divisors is an integer number (111129131421).
Almost surely, 21331501113150 is an apocalyptic number.
1331501113150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1331501113150 is an abundant number, since it is smaller than the sum of its proper divisors (1335598040954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1331501113150 is a wasteful number, since it uses less digits than its factorization.
1331501113150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2048463276 (or 2048463271 counting only the distinct ones).
The product of its (nonzero) digits is 675, while the sum is 25.
Adding to 1331501113150 its reverse (513111051331), we get a palindrome (1844612164481).
The spelling of 1331501113150 in words is "one trillion, three hundred thirty-one billion, five hundred one million, one hundred thirteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •