Base | Representation |
---|---|
bin | 110011011111000000101011… |
… | …011011010110011010000101 |
3 | 1002200201122000220012002020021 |
4 | 303133000223123112122011 |
5 | 214134323004013410302 |
6 | 2121325052352535141 |
7 | 65460062200134442 |
oct | 6337005333263205 |
9 | 1080648026162207 |
10 | 226431404435077 |
11 | 6616a023827006 |
12 | 2148bb0b2514b1 |
13 | 994650b5781aa |
14 | 3dcb4a49c69c9 |
15 | 1b2a00184e437 |
hex | cdf02b6d6685 |
226431404435077 has 2 divisors, whose sum is σ = 226431404435078. Its totient is φ = 226431404435076.
The previous prime is 226431404435059. The next prime is 226431404435179. The reversal of 226431404435077 is 770534404134622.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 196210448460196 + 30220955974881 = 14007514^2 + 5497359^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-226431404435077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (226431404435017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 113215702217538 + 113215702217539.
It is an arithmetic number, because the mean of its divisors is an integer number (113215702217539).
Almost surely, 2226431404435077 is an apocalyptic number.
It is an amenable number.
226431404435077 is a deficient number, since it is larger than the sum of its proper divisors (1).
226431404435077 is an equidigital number, since it uses as much as digits as its factorization.
226431404435077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13547520, while the sum is 52.
Adding to 226431404435077 its reverse (770534404134622), we get a palindrome (996965808569699).
The spelling of 226431404435077 in words is "two hundred twenty-six trillion, four hundred thirty-one billion, four hundred four million, four hundred thirty-five thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •