Base | Representation |
---|---|
bin | 1100001111000011110… |
… | …1101000110101100111 |
3 | 202002120021111021112111 |
4 | 3003300331220311213 |
5 | 11420442441320403 |
6 | 240322015301451 |
7 | 21120660016642 |
oct | 3036075506547 |
9 | 662507437474 |
10 | 210201120103 |
11 | 81167063777 |
12 | 348a3b1a887 |
13 | 16a8b896710 |
14 | a260c38a59 |
15 | 5703d0d56d |
hex | 30f0f68d67 |
210201120103 has 4 divisors (see below), whose sum is σ = 226370437048. Its totient is φ = 194031803160.
The previous prime is 210201120097. The next prime is 210201120119. The reversal of 210201120103 is 301021102012.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 210201120103 - 29 = 210201119591 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 16169316931 = 210201120103 / (2 + 1 + 0 + 2 + 0 + 1 + 1 + 2 + 0 + 1 + 0 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210201120193) 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, 8084658453 + ... + 8084658478.
It is an arithmetic number, because the mean of its divisors is an integer number (56592609262).
Almost surely, 2210201120103 is an apocalyptic number.
210201120103 is a deficient number, since it is larger than the sum of its proper divisors (16169316945).
210201120103 is a wasteful number, since it uses less digits than its factorization.
210201120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16169316944.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 210201120103 its reverse (301021102012), we get a palindrome (511222222115).
The spelling of 210201120103 in words is "two hundred ten billion, two hundred one million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •