Base | Representation |
---|---|
bin | 1100001110110010111… |
… | …1111001111111101111 |
3 | 202002101100102220120110 |
4 | 3003230233321333233 |
5 | 11420321341132003 |
6 | 240311011551103 |
7 | 21116141012265 |
oct | 3035457717757 |
9 | 662340386513 |
10 | 210130411503 |
11 | 81130159311 |
12 | 348842bb493 |
13 | 16a7a03a4cc |
14 | a2556b0435 |
15 | 56ec9e2a03 |
hex | 30ecbf9fef |
210130411503 has 4 divisors (see below), whose sum is σ = 280173882008. Its totient is φ = 140086941000.
The previous prime is 210130411487. The next prime is 210130411523. The reversal of 210130411503 is 305114031012.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 210130411503 - 24 = 210130411487 is a prime.
It is a super-2 number, since 2×2101304115032 (a number of 23 digits) contains 22 as substring.
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 210130411503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210130411523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35021735248 + ... + 35021735253.
It is an arithmetic number, because the mean of its divisors is an integer number (70043470502).
Almost surely, 2210130411503 is an apocalyptic number.
210130411503 is a deficient number, since it is larger than the sum of its proper divisors (70043470505).
210130411503 is an equidigital number, since it uses as much as digits as its factorization.
210130411503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70043470504.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 210130411503 its reverse (305114031012), we get a palindrome (515244442515).
The spelling of 210130411503 in words is "two hundred ten billion, one hundred thirty million, four hundred eleven thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •