Base | Representation |
---|---|
bin | 1100001111000110001… |
… | …1011001110101100101 |
3 | 202002120222010020211021 |
4 | 3003301203121311211 |
5 | 11421003010121013 |
6 | 240323011411141 |
7 | 21121140122002 |
oct | 3036143316545 |
9 | 662528106737 |
10 | 210211020133 |
11 | 81171705814 |
12 | 348a72b3ab1 |
13 | 16a9095191a |
14 | a2622948a9 |
15 | 5704b16a8d |
hex | 30f18d9d65 |
210211020133 has 4 divisors (see below), whose sum is σ = 219350629728. Its totient is φ = 201071410540.
The previous prime is 210211020113. The next prime is 210211020197. The reversal of 210211020133 is 331020112012.
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 a de Polignac number, because none of the positive numbers 2k-210211020133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210211020113) 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, 4569804763 + ... + 4569804808.
It is an arithmetic number, because the mean of its divisors is an integer number (54837657432).
Almost surely, 2210211020133 is an apocalyptic number.
210211020133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210211020133 is a deficient number, since it is larger than the sum of its proper divisors (9139609595).
210211020133 is an equidigital number, since it uses as much as digits as its factorization.
210211020133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9139609594.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 210211020133 its reverse (331020112012), we get a palindrome (541231132145).
The spelling of 210211020133 in words is "two hundred ten billion, two hundred eleven million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •