Base | Representation |
---|---|
bin | 10110111111001111000000… |
… | …10011000111110000000011 |
3 | 20121222122120100200222122001 |
4 | 23133213200103013300003 |
5 | 23111212411200343431 |
6 | 255302525502124431 |
7 | 13435130453431621 |
oct | 1337474023076003 |
9 | 217878510628561 |
10 | 50551233215491 |
11 | 1511a726311698 |
12 | 5805201880717 |
13 | 2228c64c64678 |
14 | c6a99ac56511 |
15 | 5c9e48534e61 |
hex | 2df9e04c7c03 |
50551233215491 has 2 divisors, whose sum is σ = 50551233215492. Its totient is φ = 50551233215490.
The previous prime is 50551233215489. The next prime is 50551233215543. The reversal of 50551233215491 is 19451233215505.
It is a happy number.
50551233215491 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 is a cyclic number.
It is not a de Polignac number, because 50551233215491 - 21 = 50551233215489 is a prime.
Together with 50551233215489, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (50551233219491) 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, 25275616607745 + 25275616607746.
It is an arithmetic number, because the mean of its divisors is an integer number (25275616607746).
Almost surely, 250551233215491 is an apocalyptic number.
50551233215491 is a deficient number, since it is larger than the sum of its proper divisors (1).
50551233215491 is an equidigital number, since it uses as much as digits as its factorization.
50551233215491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810000, while the sum is 46.
The spelling of 50551233215491 in words is "fifty trillion, five hundred fifty-one billion, two hundred thirty-three million, two hundred fifteen thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •