Base | Representation |
---|---|
bin | 1100001110010100001… |
… | …0110001100111111101 |
3 | 202002001100012020201012 |
4 | 3003211002301213331 |
5 | 11420040242441341 |
6 | 240250113125005 |
7 | 21113011145135 |
oct | 3034502614775 |
9 | 662040166635 |
10 | 210001140221 |
11 | 81074194944 |
12 | 34848b59765 |
13 | 16a59318622 |
14 | a24245dac5 |
15 | 56e14aa0eb |
hex | 30e50b19fd |
210001140221 has 4 divisors (see below), whose sum is σ = 214884887712. Its totient is φ = 205117392732.
The previous prime is 210001140203. The next prime is 210001140281. The reversal of 210001140221 is 122041100012.
It is a happy number.
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 not a de Polignac number, because 210001140221 - 234 = 192821271037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 210001140196 and 210001140205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210001140281) 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, 2441873681 + ... + 2441873766.
It is an arithmetic number, because the mean of its divisors is an integer number (53721221928).
Almost surely, 2210001140221 is an apocalyptic number.
It is an amenable number.
210001140221 is a deficient number, since it is larger than the sum of its proper divisors (4883747491).
210001140221 is an equidigital number, since it uses as much as digits as its factorization.
210001140221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4883747490.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210001140221 its reverse (122041100012), we get a palindrome (332042240233).
The spelling of 210001140221 in words is "two hundred ten billion, one million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •