Base | Representation |
---|---|
bin | 1100110111010101001… |
… | …0110100100000001010 |
3 | 210010110122120020101101 |
4 | 3031311102310200022 |
5 | 12110112331400020 |
6 | 245310421012014 |
7 | 21652602126616 |
oct | 3156522644012 |
9 | 703418506341 |
10 | 221011200010 |
11 | 85804073807 |
12 | 36a0025400a |
13 | 17ac2355ac3 |
14 | a9a87cc346 |
15 | 5b37d8500a |
hex | 33754b480a |
221011200010 has 8 divisors (see below), whose sum is σ = 397820160036. Its totient is φ = 88404480000.
The previous prime is 221011200001. The next prime is 221011200031. The reversal of 221011200010 is 10002110122.
It can be written as a sum of positive squares in 2 ways, for example, as 220964864761 + 46335249 = 470069^2 + 6807^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 22101120001 = 221011200010 / (2 + 2 + 1 + 0 + 1 + 1 + 2 + 0 + 0 + 0 + 1 + 0).
It is a self number, because there is not a number n which added to its sum of digits gives 221011200010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11050559991 + ... + 11050560010.
Almost surely, 2221011200010 is an apocalyptic number.
221011200010 is a deficient number, since it is larger than the sum of its proper divisors (176808960026).
221011200010 is a wasteful number, since it uses less digits than its factorization.
221011200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22101120008.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 221011200010 its reverse (10002110122), we get a palindrome (231013310132).
The spelling of 221011200010 in words is "two hundred twenty-one billion, eleven million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •