Base | Representation |
---|---|
bin | 1100110111101010100… |
… | …1011000010101001011 |
3 | 210010200220112112211100 |
4 | 3031322221120111023 |
5 | 12110303324000021 |
6 | 245323345432443 |
7 | 21655042330323 |
oct | 3157251302513 |
9 | 703626475740 |
10 | 221101000011 |
11 | 8584a828891 |
12 | 36a2633b723 |
13 | 17b07b379b8 |
14 | a9b66c6283 |
15 | 5b40bc2626 |
hex | 337aa5854b |
221101000011 has 48 divisors (see below), whose sum is σ = 346107228480. Its totient is φ = 135639567360.
The previous prime is 221100999991. The next prime is 221101000033. The reversal of 221101000011 is 110000101122.
It is a happy number.
It is not a de Polignac number, because 221101000011 - 26 = 221100999947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 221100999957 and 221101000002.
It is not an unprimeable number, because it can be changed into a prime (221101007011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 519471 + ... + 843831.
It is an arithmetic number, because the mean of its divisors is an integer number (7210567260).
Almost surely, 2221101000011 is an apocalyptic number.
221101000011 is a deficient number, since it is larger than the sum of its proper divisors (125006228469).
221101000011 is a wasteful number, since it uses less digits than its factorization.
221101000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324516 (or 324513 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 221101000011 its reverse (110000101122), we get a palindrome (331101101133).
It can be divided in two parts, 22110 and 1000011, that added together give a square (1022121 = 10112).
The spelling of 221101000011 in words is "two hundred twenty-one billion, one hundred one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •