Base | Representation |
---|---|
bin | 101110110110001101… |
… | …001101100111101111 |
3 | 11210211121020212101012 |
4 | 232312031031213233 |
5 | 1311004144312411 |
6 | 35035212535435 |
7 | 3430343116232 |
oct | 566615154757 |
9 | 153747225335 |
10 | 50301557231 |
11 | 1a372a10502 |
12 | 98b9a8157b |
13 | 4988394563 |
14 | 26127cb419 |
15 | 14960b018b |
hex | bb634d9ef |
50301557231 has 2 divisors, whose sum is σ = 50301557232. Its totient is φ = 50301557230.
The previous prime is 50301557219. The next prime is 50301557269. The reversal of 50301557231 is 13275510305.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50301557231 - 26 = 50301557167 is a prime.
It is a super-2 number, since 2×503015572312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50301553231) 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, 25150778615 + 25150778616.
It is an arithmetic number, because the mean of its divisors is an integer number (25150778616).
Almost surely, 250301557231 is an apocalyptic number.
50301557231 is a deficient number, since it is larger than the sum of its proper divisors (1).
50301557231 is an equidigital number, since it uses as much as digits as its factorization.
50301557231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15750, while the sum is 32.
The spelling of 50301557231 in words is "fifty billion, three hundred one million, five hundred fifty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •