Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0001101100010101111 |
3 | 110110001221112221002222 |
4 | 1321100212031202233 |
5 | 4113123002304403 |
6 | 135451423505555 |
7 | 12256336023323 |
oct | 1712046154257 |
9 | 413057487088 |
10 | 130201213103 |
11 | 50244210555 |
12 | 212981582bb |
13 | c37c795040 |
14 | 64320c5983 |
15 | 35c085c338 |
hex | 1e5098d8af |
130201213103 has 8 divisors (see below), whose sum is σ = 140222178096. Its totient is φ = 120181032000.
The previous prime is 130201213099. The next prime is 130201213111. The reversal of 130201213103 is 301312102031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130201213103 - 22 = 130201213099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201213133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175028 + ... + 539478.
It is an arithmetic number, because the mean of its divisors is an integer number (17527772262).
Almost surely, 2130201213103 is an apocalyptic number.
130201213103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
130201213103 is a deficient number, since it is larger than the sum of its proper divisors (10020964993).
130201213103 is a wasteful number, since it uses less digits than its factorization.
130201213103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391945.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130201213103 its reverse (301312102031), we get a palindrome (431513315134).
The spelling of 130201213103 in words is "one hundred thirty billion, two hundred one million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •