Base | Representation |
---|---|
bin | 111100101010010000… |
… | …1010010001001110011 |
3 | 110110020112101210002200 |
4 | 1321110201102021303 |
5 | 4113241324431011 |
6 | 135502134314243 |
7 | 12261065325600 |
oct | 1712441221163 |
9 | 413215353080 |
10 | 130267030131 |
11 | 50278384897 |
12 | 212b61b8983 |
13 | c3902ca924 |
14 | 643ab396a7 |
15 | 35c650d856 |
hex | 1e54852273 |
130267030131 has 72 divisors (see below), whose sum is σ = 224386596720. Its totient is φ = 72573387264.
The previous prime is 130267030121. The next prime is 130267030151. The reversal of 130267030131 is 131030762031.
It is not a de Polignac number, because 130267030131 - 26 = 130267030067 is a prime.
It is a super-2 number, since 2×1302670301312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130267030095 and 130267030104.
It is not an unprimeable number, because it can be changed into a prime (130267030121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 10783911 + ... + 10795983.
It is an arithmetic number, because the mean of its divisors is an integer number (3116480510).
Almost surely, 2130267030131 is an apocalyptic number.
130267030131 is a deficient number, since it is larger than the sum of its proper divisors (94119566589).
130267030131 is a wasteful number, since it uses less digits than its factorization.
130267030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12705 (or 12695 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
Adding to 130267030131 its reverse (131030762031), we get a palindrome (261297792162).
The spelling of 130267030131 in words is "one hundred thirty billion, two hundred sixty-seven million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •