Base | Representation |
---|---|
bin | 11101100101010110011000… |
… | …100101000010000000110011 |
3 | 122001200101122220012201002011 |
4 | 131211112120211002000303 |
5 | 114023210242030022011 |
6 | 1140415413304303351 |
7 | 36256065123403216 |
oct | 3545263045020063 |
9 | 561611586181064 |
10 | 130110004142131 |
11 | 38503385417392 |
12 | 12714235171b57 |
13 | 577a4228a2550 |
14 | 241b501b3d77d |
15 | 10096d6c0d621 |
hex | 765598942033 |
130110004142131 has 32 divisors (see below), whose sum is σ = 151638473127680. Its totient is φ = 110607647472000.
The previous prime is 130110004142071. The next prime is 130110004142201. The reversal of 130110004142131 is 131241400011031.
It is a cyclic number.
It is not a de Polignac number, because 130110004142131 - 225 = 130109970587699 is a prime.
It is a super-3 number, since 3×1301100041421313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130110004842131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26788020 + ... + 31270081.
It is an arithmetic number, because the mean of its divisors is an integer number (4738702285240).
Almost surely, 2130110004142131 is an apocalyptic number.
130110004142131 is a deficient number, since it is larger than the sum of its proper divisors (21528468985549).
130110004142131 is a wasteful number, since it uses less digits than its factorization.
130110004142131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58058387.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 130110004142131 its reverse (131241400011031), we get a palindrome (261351404153162).
The spelling of 130110004142131 in words is "one hundred thirty trillion, one hundred ten billion, four million, one hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •