Base | Representation |
---|---|
bin | 11101100101001111110111… |
… | …111000000110101110011101 |
3 | 122001122201121200020002010110 |
4 | 131211033313320012232131 |
5 | 114023101432314334401 |
6 | 1140412255445000233 |
7 | 36255426643135260 |
oct | 3545176770065635 |
9 | 561581550202113 |
10 | 130103013043101 |
11 | 385004180a219a |
12 | 12712a039b3079 |
13 | 577987a394b67 |
14 | 241b03b45ccd7 |
15 | 10094280a19d6 |
hex | 7653f7e06b9d |
130103013043101 has 64 divisors (see below), whose sum is σ = 203170813378560. Its totient is φ = 72511408189440.
The previous prime is 130103013043013. The next prime is 130103013043181. The reversal of 130103013043101 is 101340310301031.
It is a de Polignac number, because none of the positive numbers 2k-130103013043101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130103013043181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 399887245 + ... + 400212461.
It is an arithmetic number, because the mean of its divisors is an integer number (3174543959040).
Almost surely, 2130103013043101 is an apocalyptic number.
It is an amenable number.
130103013043101 is a deficient number, since it is larger than the sum of its proper divisors (73067800335459).
130103013043101 is a wasteful number, since it uses less digits than its factorization.
130103013043101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326674.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130103013043101 its reverse (101340310301031), we get a palindrome (231443323344132).
The spelling of 130103013043101 in words is "one hundred thirty trillion, one hundred three billion, thirteen million, forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •