Base | Representation |
---|---|
bin | 1100111000100001111… |
… | …1001001110010011111 |
3 | 210011022002110112101002 |
4 | 3032020133021302133 |
5 | 12111242244400111 |
6 | 245402402340515 |
7 | 21663562105316 |
oct | 3161037116237 |
9 | 704262415332 |
10 | 221333200031 |
11 | 85959904129 |
12 | 36a9005a73b |
13 | 17b43c87468 |
14 | a9d948b27d |
15 | 5b5628c63b |
hex | 33887c9c9f |
221333200031 has 4 divisors (see below), whose sum is σ = 221355497064. Its totient is φ = 221310903000.
The previous prime is 221333199947. The next prime is 221333200091. The reversal of 221333200031 is 130002333122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 221333200031 - 218 = 221332937887 is a prime.
It is a super-2 number, since 2×2213332000312 (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 = 221333199976 and 221333200012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221333200091) 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, 11133620 + ... + 11153481.
It is an arithmetic number, because the mean of its divisors is an integer number (55338874266).
Almost surely, 2221333200031 is an apocalyptic number.
221333200031 is a deficient number, since it is larger than the sum of its proper divisors (22297033).
221333200031 is an equidigital number, since it uses as much as digits as its factorization.
221333200031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22297032.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 221333200031 its reverse (130002333122), we get a palindrome (351335533153).
The spelling of 221333200031 in words is "two hundred twenty-one billion, three hundred thirty-three million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •