Base | Representation |
---|---|
bin | 1001001101101001100100… |
… | …0001100010111001011111 |
3 | 1022212102120002201100021020 |
4 | 2103122121001202321133 |
5 | 2311432421122444403 |
6 | 33313412003535223 |
7 | 2063606220001056 |
oct | 223323101427137 |
9 | 38772502640236 |
10 | 10130100203103 |
11 | 3256173523231 |
12 | 117734608a513 |
13 | 586358a1511a |
14 | 270429a3d39d |
15 | 12879199b453 |
hex | 93699062e5f |
10130100203103 has 8 divisors (see below), whose sum is σ = 13972552004400. Its totient is φ = 6520524268608.
The previous prime is 10130100203033. The next prime is 10130100203129. The reversal of 10130100203103 is 30130200103101.
10130100203103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10130100203103 - 28 = 10130100202847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130100203173) 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, 58218966598 + ... + 58218966771.
It is an arithmetic number, because the mean of its divisors is an integer number (1746569000550).
Almost surely, 210130100203103 is an apocalyptic number.
10130100203103 is a deficient number, since it is larger than the sum of its proper divisors (3842451801297).
10130100203103 is a wasteful number, since it uses less digits than its factorization.
10130100203103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116437933401.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 10130100203103 its reverse (30130200103101), we get a palindrome (40260300306204).
The spelling of 10130100203103 in words is "ten trillion, one hundred thirty billion, one hundred million, two hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •