Base | Representation |
---|---|
bin | 11101100101100010101011… |
… | …011000000011101010011101 |
3 | 122001201122201211211210102121 |
4 | 131211202223120003222131 |
5 | 114023414310312110023 |
6 | 1140425435212022541 |
7 | 36260043211002223 |
oct | 3545425330035235 |
9 | 561648654753377 |
10 | 130123204410013 |
11 | 38508a39647a91 |
12 | 127168b9a61a51 |
13 | 577b7475c3449 |
14 | 241bdd4d1ab13 |
15 | 1009c0aa1dd5d |
hex | 7658ab603a9d |
130123204410013 has 32 divisors (see below), whose sum is σ = 137252783923200. Its totient is φ = 123256525392000.
The previous prime is 130123204410011. The next prime is 130123204410109. The reversal of 130123204410013 is 310014402321031.
It is a cyclic number.
It is not a de Polignac number, because 130123204410013 - 21 = 130123204410011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130123204410013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130123204410011) 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, 44227128 + ... + 47077438.
It is an arithmetic number, because the mean of its divisors is an integer number (4289149497600).
Almost surely, 2130123204410013 is an apocalyptic number.
It is an amenable number.
130123204410013 is a deficient number, since it is larger than the sum of its proper divisors (7129579513187).
130123204410013 is a wasteful number, since it uses less digits than its factorization.
130123204410013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2850673.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 130123204410013 its reverse (310014402321031), we get a palindrome (440137606731044).
The spelling of 130123204410013 in words is "one hundred thirty trillion, one hundred twenty-three billion, two hundred four million, four hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •