Base | Representation |
---|---|
bin | 11101101000100101010101… |
… | …000101001001110010101111 |
3 | 122002110122012210202102110211 |
4 | 131220211111011021302233 |
5 | 114040330331230330221 |
6 | 1141105442443243251 |
7 | 36311122443206500 |
oct | 3550452505116257 |
9 | 562418183672424 |
10 | 130332210011311 |
11 | 38589641885790 |
12 | 1274b309519527 |
13 | 57953755a4289 |
14 | 2428181070ba7 |
15 | 101038e8c96e1 |
hex | 768955149caf |
130332210011311 has 48 divisors (see below), whose sum is σ = 166568684221440. Its totient is φ = 100838533158720.
The previous prime is 130332210011303. The next prime is 130332210011357. The reversal of 130332210011311 is 113110012233031.
It is not a de Polignac number, because 130332210011311 - 23 = 130332210011303 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 (130332210011111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43860606 + ... + 46737748.
It is an arithmetic number, because the mean of its divisors is an integer number (3470180921280).
Almost surely, 2130332210011311 is an apocalyptic number.
130332210011311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130332210011311 is a deficient number, since it is larger than the sum of its proper divisors (36236474210129).
130332210011311 is a wasteful number, since it uses less digits than its factorization.
130332210011311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2877764 (or 2877757 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130332210011311 its reverse (113110012233031), we get a palindrome (243442222244342).
The spelling of 130332210011311 in words is "one hundred thirty trillion, three hundred thirty-two billion, two hundred ten million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •