Base | Representation |
---|---|
bin | 101110110000100000… |
… | …111010111011000111 |
3 | 11210120221120010010021 |
4 | 232300200322323013 |
5 | 1310310222411411 |
6 | 35021522040011 |
7 | 3425103320305 |
oct | 566040727307 |
9 | 153527503107 |
10 | 50206060231 |
11 | 1a324015168 |
12 | 9891aa9007 |
13 | 4971669562 |
14 | 2603c4d275 |
15 | 148c9e9a71 |
hex | bb083aec7 |
50206060231 has 2 divisors, whose sum is σ = 50206060232. Its totient is φ = 50206060230.
The previous prime is 50206060189. The next prime is 50206060249. The reversal of 50206060231 is 13206060205.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50206060231 - 231 = 48058576583 is a prime.
It is a super-2 number, since 2×502060602312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50206060196 and 50206060205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50206064231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25103030115 + 25103030116.
It is an arithmetic number, because the mean of its divisors is an integer number (25103030116).
Almost surely, 250206060231 is an apocalyptic number.
50206060231 is a deficient number, since it is larger than the sum of its proper divisors (1).
50206060231 is an equidigital number, since it uses as much as digits as its factorization.
50206060231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
The spelling of 50206060231 in words is "fifty billion, two hundred six million, sixty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •