Base | Representation |
---|---|
bin | 1111100000101… |
… | …01001010010111 |
3 | 100001211021111201 |
4 | 13300111022113 |
5 | 231302010403 |
6 | 20524413331 |
7 | 3136626514 |
oct | 760251227 |
9 | 301737451 |
10 | 130110103 |
11 | 67497712 |
12 | 376a7247 |
13 | 20c56936 |
14 | 133cc30b |
15 | b65121d |
hex | 7c15297 |
130110103 has 8 divisors (see below), whose sum is σ = 136839168. Its totient is φ = 123470424.
The previous prime is 130110091. The next prime is 130110107. The reversal of 130110103 is 301011031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130110103 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 130110103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130110107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19351 + ... + 25192.
It is an arithmetic number, because the mean of its divisors is an integer number (17104896).
Almost surely, 2130110103 is an apocalyptic number.
130110103 is a deficient number, since it is larger than the sum of its proper divisors (6729065).
130110103 is a wasteful number, since it uses less digits than its factorization.
130110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44693.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 130110103 is about 11406.5815650439. The cubic root of 130110103 is about 506.7226767971.
Adding to 130110103 its reverse (301011031), we get a palindrome (431121134).
It can be divided in two parts, 13011010 and 3, that multiplied together give a triangular number (39033030 = T8835).
The spelling of 130110103 in words is "one hundred thirty million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •