Base | Representation |
---|---|
bin | 110011011000111000101101… |
… | …011011000100110100011001 |
3 | 1002122020101200111210120021212 |
4 | 303120320231123010310121 |
5 | 214110424031431404312 |
6 | 2120403445445112505 |
7 | 65414502440041544 |
oct | 6330705533046431 |
9 | 1078211614716255 |
10 | 226010531122457 |
11 | 66017589810a24 |
12 | 214224316b8735 |
13 | 9915917650ac3 |
14 | 3db4d7a56b85b |
15 | 1b1e0bc6d0822 |
hex | cd8e2d6c4d19 |
226010531122457 has 2 divisors, whose sum is σ = 226010531122458. Its totient is φ = 226010531122456.
The previous prime is 226010531122403. The next prime is 226010531122469. The reversal of 226010531122457 is 754221135010622.
226010531122457 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., 225312978764041 + 697552358416 = 15010429^2 + 835196^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-226010531122457 is a prime.
It is not a weakly prime, because it can be changed into another prime (226010531124457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 113005265561228 + 113005265561229.
It is an arithmetic number, because the mean of its divisors is an integer number (113005265561229).
Almost surely, 2226010531122457 is an apocalyptic number.
It is an amenable number.
226010531122457 is a deficient number, since it is larger than the sum of its proper divisors (1).
226010531122457 is an equidigital number, since it uses as much as digits as its factorization.
226010531122457 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201600, while the sum is 41.
The spelling of 226010531122457 in words is "two hundred twenty-six trillion, ten billion, five hundred thirty-one million, one hundred twenty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •