Base | Representation |
---|---|
bin | 110100100101000001000001… |
… | …110000011110100000111101 |
3 | 1010022202112101111110212121201 |
4 | 310211001001300132200331 |
5 | 220302132401431143311 |
6 | 2135451101304055501 |
7 | 66464456600411053 |
oct | 6445010160364075 |
9 | 1108675344425551 |
10 | 231242142443581 |
11 | 67754272a37065 |
12 | 21b28339764591 |
13 | 9c0506ab97079 |
14 | 41162724401d3 |
15 | 1bb02136889c1 |
hex | d25041c1e83d |
231242142443581 has 2 divisors, whose sum is σ = 231242142443582. Its totient is φ = 231242142443580.
The previous prime is 231242142443567. The next prime is 231242142443593. The reversal of 231242142443581 is 185344241242132.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 230787475439481 + 454667004100 = 15191691^2 + 674290^2 .
It is a cyclic number.
It is not a de Polignac number, because 231242142443581 - 225 = 231242108889149 is a prime.
It is a super-2 number, since 2×2312421424435812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231242142443381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115621071221790 + 115621071221791.
It is an arithmetic number, because the mean of its divisors is an integer number (115621071221791).
Almost surely, 2231242142443581 is an apocalyptic number.
It is an amenable number.
231242142443581 is a deficient number, since it is larger than the sum of its proper divisors (1).
231242142443581 is an equidigital number, since it uses as much as digits as its factorization.
231242142443581 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1474560, while the sum is 46.
The spelling of 231242142443581 in words is "two hundred thirty-one trillion, two hundred forty-two billion, one hundred forty-two million, four hundred forty-three thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •