Base | Representation |
---|---|
bin | 11101100101100000101000… |
… | …000000011110011101110001 |
3 | 122001201110001020122010222010 |
4 | 131211200220000132131301 |
5 | 114023400302101204131 |
6 | 1140424432400433133 |
7 | 36256634456225121 |
oct | 3545405000363561 |
9 | 561643036563863 |
10 | 130121000413041 |
11 | 38508008538490 |
12 | 127163a39187a9 |
13 | 577b485ac2721 |
14 | 241bc6631cc81 |
15 | 1009b2c2b2b46 |
hex | 76582801e771 |
130121000413041 has 64 divisors (see below), whose sum is σ = 197664691101696. Its totient is φ = 75368020358400.
The previous prime is 130121000413003. The next prime is 130121000413213. The reversal of 130121000413041 is 140314000121031.
It is a de Polignac number, because none of the positive numbers 2k-130121000413041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130121000412999 and 130121000413017.
It is not an unprimeable number, because it can be changed into a prime (130121000413541) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6922425055 + ... + 6922443851.
It is an arithmetic number, because the mean of its divisors is an integer number (3088510798464).
Almost surely, 2130121000413041 is an apocalyptic number.
130121000413041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130121000413041 is a deficient number, since it is larger than the sum of its proper divisors (67543690688655).
130121000413041 is a wasteful number, since it uses less digits than its factorization.
130121000413041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26142.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 130121000413041 its reverse (140314000121031), we get a palindrome (270435000534072).
The spelling of 130121000413041 in words is "one hundred thirty trillion, one hundred twenty-one billion, four hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •