Base | Representation |
---|---|
bin | 11101110010010011100011… |
… | …100011010001001001010100 |
3 | 122011211111201112221121212021 |
4 | 131302103203203101021110 |
5 | 114132302123432420200 |
6 | 1142340414415302524 |
7 | 36410314025135134 |
oct | 3562234343211124 |
9 | 564744645847767 |
10 | 131000320201300 |
11 | 38816a186450a0 |
12 | 128388a621aa44 |
13 | 581337aca2744 |
14 | 244c640d56ac4 |
15 | 1022943eae41a |
hex | 7724e38d1254 |
131000320201300 has 72 divisors (see below), whose sum is σ = 311348997826272. Its totient is φ = 47446693200000.
The previous prime is 131000320201291. The next prime is 131000320201337. The reversal of 131000320201300 is 3102023000131.
It is a super-2 number, since 2×1310003202013002 (a number of 29 digits) contains 22 as substring.
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, 236957367 + ... + 237509566.
It is an arithmetic number, because the mean of its divisors is an integer number (4324291636476).
Almost surely, 2131000320201300 is an apocalyptic number.
131000320201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131000320201300 is an abundant number, since it is smaller than the sum of its proper divisors (180348677624972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131000320201300 is a wasteful number, since it uses less digits than its factorization.
131000320201300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474467209 (or 474467202 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 131000320201300 its reverse (3102023000131), we get a palindrome (134102343201431).
The spelling of 131000320201300 in words is "one hundred thirty-one trillion, three hundred twenty million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •