Base | Representation |
---|---|
bin | 11101110111000110101011… |
… | …111101011110111101000101 |
3 | 122020000000221110212202112002 |
4 | 131313012223331132331011 |
5 | 114203203021102000201 |
6 | 1143152114241435045 |
7 | 36443200210344353 |
oct | 3567065375367505 |
9 | 566000843782462 |
10 | 131330100031301 |
11 | 38933867776446 |
12 | 128907a093ba85 |
13 | 58384b5699522 |
14 | 24605a71907d3 |
15 | 102b2e5ca676b |
hex | 7771abf5ef45 |
131330100031301 has 32 divisors (see below), whose sum is σ = 139011619848192. Its totient is φ = 123824339179200.
The previous prime is 131330100031267. The next prime is 131330100031313. The reversal of 131330100031301 is 103130001033131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131330100031301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131330106031301) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4728683051 + ... + 4728710823.
It is an arithmetic number, because the mean of its divisors is an integer number (4344113120256).
Almost surely, 2131330100031301 is an apocalyptic number.
It is an amenable number.
131330100031301 is a deficient number, since it is larger than the sum of its proper divisors (7681519816891).
131330100031301 is a wasteful number, since it uses less digits than its factorization.
131330100031301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37073.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 131330100031301 its reverse (103130001033131), we get a palindrome (234460101064432).
The spelling of 131330100031301 in words is "one hundred thirty-one trillion, three hundred thirty billion, one hundred million, thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •