Base | Representation |
---|---|
bin | 110011010100101111111001… |
… | …101100010000111001001101 |
3 | 1002121020012202122220211202022 |
4 | 303110233321230100321031 |
5 | 214041244222003342342 |
6 | 2120025103235135525 |
7 | 65355115356040064 |
oct | 6324577154207115 |
9 | 1077205678824668 |
10 | 225726195371597 |
11 | 65a17a3a687978 |
12 | 213972ba1445a5 |
13 | 98c4b72b70b8b |
14 | 3da52c595d1db |
15 | 1b169ca2e59d2 |
hex | cd4bf9b10e4d |
225726195371597 has 2 divisors, whose sum is σ = 225726195371598. Its totient is φ = 225726195371596.
The previous prime is 225726195371563. The next prime is 225726195371669. The reversal of 225726195371597 is 795173591627522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124569952310281 + 101156243061316 = 11161091^2 + 10057646^2 .
It is a cyclic number.
It is not a de Polignac number, because 225726195371597 - 242 = 221328148860493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 225726195371597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225726195371197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112863097685798 + 112863097685799.
It is an arithmetic number, because the mean of its divisors is an integer number (112863097685799).
Almost surely, 2225726195371597 is an apocalyptic number.
It is an amenable number.
225726195371597 is a deficient number, since it is larger than the sum of its proper divisors (1).
225726195371597 is an equidigital number, since it uses as much as digits as its factorization.
225726195371597 is an evil number, because the sum of its binary digits is even.
The product of its digits is 500094000, while the sum is 71.
The spelling of 225726195371597 in words is "two hundred twenty-five trillion, seven hundred twenty-six billion, one hundred ninety-five million, three hundred seventy-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •