Base | Representation |
---|---|
bin | 101110100111100000… |
… | …101011010110111011 |
3 | 11210012102022112112121 |
4 | 232213200223112323 |
5 | 1310003040022111 |
6 | 34554524222111 |
7 | 3421260331033 |
oct | 564740532673 |
9 | 153172275477 |
10 | 50055001531 |
11 | 1a25681a567 |
12 | 984b39a937 |
13 | 4949289802 |
14 | 25cbb6a8c3 |
15 | 147e60b871 |
hex | ba782b5bb |
50055001531 has 2 divisors, whose sum is σ = 50055001532. Its totient is φ = 50055001530.
The previous prime is 50055001487. The next prime is 50055001541. The reversal of 50055001531 is 13510055005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50055001531 - 223 = 50046612923 is a prime.
It is a super-2 number, since 2×500550015312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50055001496 and 50055001505.
It is not a weakly prime, because it can be changed into another prime (50055001541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027500765 + 25027500766.
It is an arithmetic number, because the mean of its divisors is an integer number (25027500766).
Almost surely, 250055001531 is an apocalyptic number.
50055001531 is a deficient number, since it is larger than the sum of its proper divisors (1).
50055001531 is an equidigital number, since it uses as much as digits as its factorization.
50055001531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1875, while the sum is 25.
Adding to 50055001531 its reverse (13510055005), we get a palindrome (63565056536).
The spelling of 50055001531 in words is "fifty billion, fifty-five million, one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.988 sec. • engine limits •