Base | Representation |
---|---|
bin | 101111101111111011110010… |
… | …100010111101010101010011 |
3 | 1000112120000101101222010012212 |
4 | 233233323302202331111103 |
5 | 210011134001224033021 |
6 | 2022345402352542335 |
7 | 62143105201361462 |
oct | 5757736242752523 |
9 | 1015500341863185 |
10 | 210002200221011 |
11 | 60a05484307a40 |
12 | 1b6779bbb519ab |
13 | 90241791c5513 |
14 | 39c023704a9d9 |
15 | 194298c24485b |
hex | befef28bd553 |
210002200221011 has 8 divisors (see below), whose sum is σ = 229094532120000. Its totient is φ = 190910072120040.
The previous prime is 210002200220933. The next prime is 210002200221019. The reversal of 210002200221011 is 110122002200012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210002200221011 - 214 = 210002200204627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210002200221019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48790961 + ... + 52920338.
It is an arithmetic number, because the mean of its divisors is an integer number (28636816515000).
Almost surely, 2210002200221011 is an apocalyptic number.
210002200221011 is a deficient number, since it is larger than the sum of its proper divisors (19092331898989).
210002200221011 is a wasteful number, since it uses less digits than its factorization.
210002200221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101899009.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210002200221011 its reverse (110122002200012), we get a palindrome (320124202421023).
The spelling of 210002200221011 in words is "two hundred ten trillion, two billion, two hundred million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •