Base | Representation |
---|---|
bin | 110100101001100001111011… |
… | …101100100110001100011001 |
3 | 1010100212012002112202202000121 |
4 | 310221201323230212030121 |
5 | 220322223204122302142 |
6 | 2140245403154433241 |
7 | 66526051100411263 |
oct | 6451417354461431 |
9 | 1110765075682017 |
10 | 231552352150297 |
11 | 6786388a260102 |
12 | 21b78492292821 |
13 | 9c283a6c88649 |
14 | 412729d4d2b33 |
15 | 1bb831c32ac67 |
hex | d2987bb26319 |
231552352150297 has 2 divisors, whose sum is σ = 231552352150298. Its totient is φ = 231552352150296.
The previous prime is 231552352150291. The next prime is 231552352150313. The reversal of 231552352150297 is 792051253255132.
231552352150297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129411191817216 + 102141160333081 = 11375904^2 + 10106491^2 .
It is a cyclic number.
It is not a de Polignac number, because 231552352150297 - 27 = 231552352150169 is a prime.
It is not a weakly prime, because it can be changed into another prime (231552352150291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115776176075148 + 115776176075149.
It is an arithmetic number, because the mean of its divisors is an integer number (115776176075149).
Almost surely, 2231552352150297 is an apocalyptic number.
It is an amenable number.
231552352150297 is a deficient number, since it is larger than the sum of its proper divisors (1).
231552352150297 is an equidigital number, since it uses as much as digits as its factorization.
231552352150297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5670000, while the sum is 52.
The spelling of 231552352150297 in words is "two hundred thirty-one trillion, five hundred fifty-two billion, three hundred fifty-two million, one hundred fifty thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •