Base | Representation |
---|---|
bin | 111100100101010111… |
… | …1101101100001110001 |
3 | 110102211002211020002022 |
4 | 1321022233231201301 |
5 | 4112422334240423 |
6 | 135433555401225 |
7 | 12254034410564 |
oct | 1711257554161 |
9 | 412732736068 |
10 | 130103040113 |
11 | 501a3857752 |
12 | 2126b2b3215 |
13 | c365341007 |
14 | 642304c4db |
15 | 35b6e18dc8 |
hex | 1e4abed871 |
130103040113 has 12 divisors (see below), whose sum is σ = 137389697280. Its totient is φ = 123184839096.
The previous prime is 130103040101. The next prime is 130103040143. The reversal of 130103040113 is 311040301031.
It is not a de Polignac number, because 130103040113 - 26 = 130103040049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130103040091 and 130103040100.
It is not an unprimeable number, because it can be changed into a prime (130103040143) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 532556 + ... + 737442.
It is an arithmetic number, because the mean of its divisors is an integer number (11449141440).
Almost surely, 2130103040113 is an apocalyptic number.
It is an amenable number.
130103040113 is a deficient number, since it is larger than the sum of its proper divisors (7286657167).
130103040113 is a wasteful number, since it uses less digits than its factorization.
130103040113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206684 (or 206665 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130103040113 its reverse (311040301031), we get a palindrome (441143341144).
The spelling of 130103040113 in words is "one hundred thirty billion, one hundred three million, forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •