Base | Representation |
---|---|
bin | 1101001011001010100… |
… | …0011011111101000001 |
3 | 210122012200200200212102 |
4 | 3102302220123331001 |
5 | 12202013310302342 |
6 | 251551005440145 |
7 | 22231540555214 |
oct | 3226250337501 |
9 | 718180620772 |
10 | 226335244097 |
11 | 87a96387946 |
12 | 37a47270055 |
13 | 18460380551 |
14 | ad5192177b |
15 | 5d4a499832 |
hex | 34b2a1bf41 |
226335244097 has 2 divisors, whose sum is σ = 226335244098. Its totient is φ = 226335244096.
The previous prime is 226335244063. The next prime is 226335244099. The reversal of 226335244097 is 790442533622.
226335244097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 165160147201 + 61175096896 = 406399^2 + 247336^2 .
It is a cyclic number.
It is not a de Polignac number, because 226335244097 - 230 = 225261502273 is a prime.
Together with 226335244099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (226335244099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 113167622048 + 113167622049.
It is an arithmetic number, because the mean of its divisors is an integer number (113167622049).
Almost surely, 2226335244097 is an apocalyptic number.
It is an amenable number.
226335244097 is a deficient number, since it is larger than the sum of its proper divisors (1).
226335244097 is an equidigital number, since it uses as much as digits as its factorization.
226335244097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 47.
The spelling of 226335244097 in words is "two hundred twenty-six billion, three hundred thirty-five million, two hundred forty-four thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •