Base | Representation |
---|---|
bin | 1100011001110111101… |
… | …1111011010111110111 |
3 | 202101001112010122212100 |
4 | 3012131323323113313 |
5 | 11442413400130403 |
6 | 241522003353143 |
7 | 21252615501333 |
oct | 3063573732767 |
9 | 671045118770 |
10 | 213103130103 |
11 | 82416185846 |
12 | 353739827b3 |
13 | 17131b8c2b6 |
14 | a4584147c3 |
15 | 58239982a3 |
hex | 319defb5f7 |
213103130103 has 6 divisors (see below), whose sum is σ = 307815632384. Its totient is φ = 142068753396.
The previous prime is 213103130099. The next prime is 213103130137. The reversal of 213103130103 is 301031301312.
It is a happy number.
213103130103 is a `hidden beast` number, since 21 + 310 + 31 + 301 + 0 + 3 = 666.
It is not a de Polignac number, because 213103130103 - 22 = 213103130099 is a prime.
It is a super-2 number, since 2×2131031301032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213103131103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11839062775 + ... + 11839062792.
Almost surely, 2213103130103 is an apocalyptic number.
213103130103 is a deficient number, since it is larger than the sum of its proper divisors (94712502281).
213103130103 is a wasteful number, since it uses less digits than its factorization.
213103130103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23678125573 (or 23678125570 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 213103130103 its reverse (301031301312), we get a palindrome (514134431415).
It can be divided in two parts, 213103 and 130103, that added together give a triangular number (343206 = T828).
The spelling of 213103130103 in words is "two hundred thirteen billion, one hundred three million, one hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •