Base | Representation |
---|---|
bin | 1100110111010101011… |
… | …0010101011011110011 |
3 | 210010110201022001012101 |
4 | 3031311112111123303 |
5 | 12110113100340311 |
6 | 245310452441231 |
7 | 21652613014651 |
oct | 3156526253363 |
9 | 703421261171 |
10 | 221012121331 |
11 | 85804642a31 |
12 | 36a00619217 |
13 | 17ac25b9271 |
14 | a9a898bdd1 |
15 | 5b37eb7ec1 |
hex | 33755956f3 |
221012121331 has 16 divisors (see below), whose sum is σ = 226284451200. Its totient is φ = 215813564928.
The previous prime is 221012121329. The next prime is 221012121359. The reversal of 221012121331 is 133121210122.
It is a cyclic number.
It is not a de Polignac number, because 221012121331 - 21 = 221012121329 is a prime.
It is a super-2 number, since 2×2210121213312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221012121299 and 221012121308.
It is not an unprimeable number, because it can be changed into a prime (221012121131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2873431 + ... + 2949343.
It is an arithmetic number, because the mean of its divisors is an integer number (14142778200).
Almost surely, 2221012121331 is an apocalyptic number.
221012121331 is a deficient number, since it is larger than the sum of its proper divisors (5272329869).
221012121331 is a wasteful number, since it uses less digits than its factorization.
221012121331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76398.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 221012121331 its reverse (133121210122), we get a palindrome (354133331453).
The spelling of 221012121331 in words is "two hundred twenty-one billion, twelve million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •