Base | Representation |
---|---|
bin | 1100011010001111101… |
… | …0000010111100000101 |
3 | 202101022111121211021021 |
4 | 3012203322002330011 |
5 | 11443120021100401 |
6 | 241535542351141 |
7 | 21255243102211 |
oct | 3064372027405 |
9 | 671274554237 |
10 | 213203300101 |
11 | 82467782a70 |
12 | 353a142b4b1 |
13 | 1714986229c |
14 | a46784b941 |
15 | 582c6832a1 |
hex | 31a3e82f05 |
213203300101 has 4 divisors (see below), whose sum is σ = 232585418304. Its totient is φ = 193821181900.
The previous prime is 213203300059. The next prime is 213203300117. The reversal of 213203300101 is 101003302312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 213203300101 - 217 = 213203169029 is a prime.
It is a super-2 number, since 2×2132033001012 (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 (213203300171) 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, 9691059085 + ... + 9691059106.
It is an arithmetic number, because the mean of its divisors is an integer number (58146354576).
Almost surely, 2213203300101 is an apocalyptic number.
It is an amenable number.
213203300101 is a deficient number, since it is larger than the sum of its proper divisors (19382118203).
213203300101 is a wasteful number, since it uses less digits than its factorization.
213203300101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19382118202.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 213203300101 its reverse (101003302312), we get a palindrome (314206602413).
The spelling of 213203300101 in words is "two hundred thirteen billion, two hundred three million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •