Base | Representation |
---|---|
bin | 11101110110101010101111… |
… | …110101101101010111111000 |
3 | 122012220011111202011002020221 |
4 | 131312222233311231113320 |
5 | 114202210101141043000 |
6 | 1143130233340025424 |
7 | 36441055613164306 |
oct | 3566525765552770 |
9 | 565804452132227 |
10 | 131300100331000 |
11 | 389220727175a7 |
12 | 12886a09b32274 |
13 | 58357143aa983 |
14 | 245cd5cbc3276 |
15 | 102a63c1db61a |
hex | 776aafd6d5f8 |
131300100331000 has 64 divisors (see below), whose sum is σ = 307243990104480. Its totient is φ = 52519740076800.
The previous prime is 131300100330961. The next prime is 131300100331021. The reversal of 131300100331000 is 133001003131.
It is a super-2 number, since 2×1313001003310002 (a number of 29 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 277997047 + ... + 278468953.
Almost surely, 2131300100331000 is an apocalyptic number.
131300100331000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131300100331000 is an abundant number, since it is smaller than the sum of its proper divisors (175943889773480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131300100331000 is a wasteful number, since it uses less digits than its factorization.
131300100331000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750161 (or 750147 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 131300100331000 its reverse (133001003131), we get a palindrome (131433101334131).
The spelling of 131300100331000 in words is "one hundred thirty-one trillion, three hundred billion, one hundred million, three hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •