Base | Representation |
---|---|
bin | 1100011001011111101… |
… | …0111010111111011111 |
3 | 202100210111020001001022 |
4 | 3012113322322333133 |
5 | 11442212030444403 |
6 | 241504000234355 |
7 | 21250251565454 |
oct | 3062772727737 |
9 | 670714201038 |
10 | 213002203103 |
11 | 823742108a8 |
12 | 3534600b9bb |
13 | 17116cb2891 |
14 | a448c6182b |
15 | 5819badd38 |
hex | 3197ebafdf |
213002203103 has 4 divisors (see below), whose sum is σ = 225531744480. Its totient is φ = 200472661728.
The previous prime is 213002203087. The next prime is 213002203123. The reversal of 213002203103 is 301302200312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213002203103 - 24 = 213002203087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17), and also a Moran number because the ratio is a prime number: 12529541359 = 213002203103 / (2 + 1 + 3 + 0 + 0 + 2 + 2 + 0 + 3 + 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 (213002203123) 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, 6264770663 + ... + 6264770696.
It is an arithmetic number, because the mean of its divisors is an integer number (56382936120).
Almost surely, 2213002203103 is an apocalyptic number.
213002203103 is a deficient number, since it is larger than the sum of its proper divisors (12529541377).
213002203103 is a wasteful number, since it uses less digits than its factorization.
213002203103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12529541376.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 213002203103 its reverse (301302200312), we get a palindrome (514304403415).
The spelling of 213002203103 in words is "two hundred thirteen billion, two million, two hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •