Base | Representation |
---|---|
bin | 111100101011010001… |
… | …1010111111000101011 |
3 | 110110022220120100112010 |
4 | 1321112203113320223 |
5 | 4113324042213311 |
6 | 135505353251003 |
7 | 12261661231116 |
oct | 1712643277053 |
9 | 413286510463 |
10 | 130301132331 |
11 | 50295657327 |
12 | 21305703a63 |
13 | c3973aab46 |
14 | 644149557d |
15 | 35c94e7da6 |
hex | 1e568d7e2b |
130301132331 has 4 divisors (see below), whose sum is σ = 173734843112. Its totient is φ = 86867421552.
The previous prime is 130301132317. The next prime is 130301132333. The reversal of 130301132331 is 133231103031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130301132331 - 29 = 130301131819 is a prime.
It is a super-3 number, since 3×1303011323313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130301132298 and 130301132307.
It is not an unprimeable number, because it can be changed into a prime (130301132333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21716855386 + ... + 21716855391.
It is an arithmetic number, because the mean of its divisors is an integer number (43433710778).
Almost surely, 2130301132331 is an apocalyptic number.
130301132331 is a deficient number, since it is larger than the sum of its proper divisors (43433710781).
130301132331 is an equidigital number, since it uses as much as digits as its factorization.
130301132331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43433710780.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 130301132331 its reverse (133231103031), we get a palindrome (263532235362).
The spelling of 130301132331 in words is "one hundred thirty billion, three hundred one million, one hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •