Base | Representation |
---|---|
bin | 1100111000001010001… |
… | …0010011111010100001 |
3 | 210011001010121100222001 |
4 | 3032002202103322201 |
5 | 12111041220132031 |
6 | 245344434444001 |
7 | 21661240400122 |
oct | 3160242237241 |
9 | 704033540861 |
10 | 221233364641 |
11 | 85908515343 |
12 | 36a62733601 |
13 | 17b293a0873 |
14 | a9ca100049 |
15 | 5b4c61b861 |
hex | 3382893ea1 |
221233364641 has 2 divisors, whose sum is σ = 221233364642. Its totient is φ = 221233364640.
The previous prime is 221233364629. The next prime is 221233364659. The reversal of 221233364641 is 146463332122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216693974016 + 4539390625 = 465504^2 + 67375^2 .
It is a cyclic number.
It is not a de Polignac number, because 221233364641 - 223 = 221224976033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221233364641.
It is not a weakly prime, because it can be changed into another prime (221233344641) by changing a digit.
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 as a sum of consecutive naturals, namely, 110616682320 + 110616682321.
It is an arithmetic number, because the mean of its divisors is an integer number (110616682321).
Almost surely, 2221233364641 is an apocalyptic number.
It is an amenable number.
221233364641 is a deficient number, since it is larger than the sum of its proper divisors (1).
221233364641 is an equidigital number, since it uses as much as digits as its factorization.
221233364641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 124416, while the sum is 37.
Adding to 221233364641 its reverse (146463332122), we get a palindrome (367696696763).
The spelling of 221233364641 in words is "two hundred twenty-one billion, two hundred thirty-three million, three hundred sixty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •