Base | Representation |
---|---|
bin | 1100001110101100011… |
… | …1010110001110011101 |
3 | 202002022102212100211011 |
4 | 3003223013112032131 |
5 | 11420242332031023 |
6 | 240304152255221 |
7 | 21115356023242 |
oct | 3035307261635 |
9 | 662272770734 |
10 | 210103002013 |
11 | 81116738143 |
12 | 348770a1511 |
13 | 16a74461688 |
14 | a251bb75c9 |
15 | 56ea3cb50d |
hex | 30eb1d639d |
210103002013 has 8 divisors (see below), whose sum is σ = 221366441088. Its totient is φ = 199016940144.
The previous prime is 210103002001. The next prime is 210103002017. The reversal of 210103002013 is 310200301012.
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-210103002013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210103001984 and 210103002002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210103002017) 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, 44341870 + ... + 44346607.
It is an arithmetic number, because the mean of its divisors is an integer number (27670805136).
Almost surely, 2210103002013 is an apocalyptic number.
210103002013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210103002013 is a deficient number, since it is larger than the sum of its proper divisors (11263439075).
210103002013 is a wasteful number, since it uses less digits than its factorization.
210103002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88688603.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 210103002013 its reverse (310200301012), we get a palindrome (520303303025).
The spelling of 210103002013 in words is "two hundred ten billion, one hundred three million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •