Base | Representation |
---|---|
bin | 1111100001001111001… |
… | …01010101101011000111 |
3 | 1212222101102012220201211 |
4 | 13300213211111223013 |
5 | 32214033422403411 |
6 | 1044544520432251 |
7 | 53345120406316 |
oct | 7604745255307 |
9 | 1788342186654 |
10 | 533240044231 |
11 | 196167115734 |
12 | 87419018687 |
13 | 3b3908623bb |
14 | 1bb47abc27d |
15 | dd0de1a221 |
hex | 7c27955ac7 |
533240044231 has 2 divisors, whose sum is σ = 533240044232. Its totient is φ = 533240044230.
The previous prime is 533240044213. The next prime is 533240044247. The reversal of 533240044231 is 132440042335.
It is a happy number.
Together with previous prime (533240044213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 533240044231 - 223 = 533231655623 is a prime.
It is a super-2 number, since 2×5332400442312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 533240044193 and 533240044202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (533240044261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 266620022115 + 266620022116.
It is an arithmetic number, because the mean of its divisors is an integer number (266620022116).
Almost surely, 2533240044231 is an apocalyptic number.
533240044231 is a deficient number, since it is larger than the sum of its proper divisors (1).
533240044231 is an equidigital number, since it uses as much as digits as its factorization.
533240044231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 533240044231 its reverse (132440042335), we get a palindrome (665680086566).
The spelling of 533240044231 in words is "five hundred thirty-three billion, two hundred forty million, forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •