Base | Representation |
---|---|
bin | 101111111001101011… |
… | …000010101011110111 |
3 | 11220202111002222200011 |
4 | 233321223002223313 |
5 | 1320313430401411 |
6 | 35343405201051 |
7 | 3500366053642 |
oct | 577153025367 |
9 | 156674088604 |
10 | 51433450231 |
11 | 1a8a3929469 |
12 | 9b74b60187 |
13 | 4b08a30a27 |
14 | 26bcc6ca59 |
15 | 1510645c21 |
hex | bf9ac2af7 |
51433450231 has 2 divisors, whose sum is σ = 51433450232. Its totient is φ = 51433450230.
The previous prime is 51433450223. The next prime is 51433450261. The reversal of 51433450231 is 13205433415.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51433450231 - 23 = 51433450223 is a prime.
It is a super-2 number, since 2×514334502312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51433450193 and 51433450202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51433450261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25716725115 + 25716725116.
It is an arithmetic number, because the mean of its divisors is an integer number (25716725116).
Almost surely, 251433450231 is an apocalyptic number.
51433450231 is a deficient number, since it is larger than the sum of its proper divisors (1).
51433450231 is an equidigital number, since it uses as much as digits as its factorization.
51433450231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 51433450231 its reverse (13205433415), we get a palindrome (64638883646).
The spelling of 51433450231 in words is "fifty-one billion, four hundred thirty-three million, four hundred fifty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •