Base | Representation |
---|---|
bin | 111101000001000110… |
… | …0011111000111010011 |
3 | 110112012221022212002011 |
4 | 1322002030133013103 |
5 | 4121324013031011 |
6 | 140110151003351 |
7 | 12316061633434 |
oct | 1720214370723 |
9 | 415187285064 |
10 | 131033330131 |
11 | 50630998380 |
12 | 2148a969557 |
13 | c482cb1692 |
14 | 64b081148b |
15 | 361d92a621 |
hex | 1e8231f1d3 |
131033330131 has 16 divisors (see below), whose sum is σ = 144984204288. Its totient is φ = 117422838400.
The previous prime is 131033330117. The next prime is 131033330137.
131033330131 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 131033330131 - 215 = 131033297363 is a prime.
It is a super-2 number, since 2×1310333301312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131033330137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6023931 + ... + 6045643.
It is an arithmetic number, because the mean of its divisors is an integer number (9061512768).
Almost surely, 2131033330131 is an apocalyptic number.
131033330131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131033330131 is a deficient number, since it is larger than the sum of its proper divisors (13950874157).
131033330131 is a wasteful number, since it uses less digits than its factorization.
131033330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29522.
The product of its (nonzero) digits is 729, while the sum is 22.
It can be divided in two parts, 131033 and 330131, that added together give a palindrome (461164).
The spelling of 131033330131 in words is "one hundred thirty-one billion, thirty-three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •