Base | Representation |
---|---|
bin | 110100100101001110011111… |
… | …100101101100100000011001 |
3 | 1010022210220201011212222112002 |
4 | 310211032133211230200121 |
5 | 220302402010000434442 |
6 | 2135501452141330345 |
7 | 66465511112130326 |
oct | 6445163745544031 |
9 | 1108726634788462 |
10 | 231256601577497 |
11 | 6775a41281a411 |
12 | 21b2b0b3b669b5 |
13 | 9c06533650202 |
14 | 4116c448b1b4d |
15 | 1bb07acc61732 |
hex | d2539f96c819 |
231256601577497 has 2 divisors, whose sum is σ = 231256601577498. Its totient is φ = 231256601577496.
The previous prime is 231256601577427. The next prime is 231256601577509. The reversal of 231256601577497 is 794775106652132.
231256601577497 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., 199285764493321 + 31970837084176 = 14116861^2 + 5654276^2 .
It is a cyclic number.
It is not a de Polignac number, because 231256601577497 - 222 = 231256597383193 is a prime.
It is not a weakly prime, because it can be changed into another prime (231256601577427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115628300788748 + 115628300788749.
It is an arithmetic number, because the mean of its divisors is an integer number (115628300788749).
Almost surely, 2231256601577497 is an apocalyptic number.
It is an amenable number.
231256601577497 is a deficient number, since it is larger than the sum of its proper divisors (1).
231256601577497 is an equidigital number, since it uses as much as digits as its factorization.
231256601577497 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 133358400, while the sum is 65.
The spelling of 231256601577497 in words is "two hundred thirty-one trillion, two hundred fifty-six billion, six hundred one million, five hundred seventy-seven thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •