Base | Representation |
---|---|
bin | 101110110010111101… |
… | …010110111111001001 |
3 | 11210200210201121110022 |
4 | 232302331112333021 |
5 | 1310401222212031 |
6 | 35025545030225 |
7 | 3426112021256 |
oct | 566275267711 |
9 | 153623647408 |
10 | 50247069641 |
11 | 1a34518513a |
12 | 98a3785375 |
13 | 4979cc7692 |
14 | 260948642d |
15 | 14913ea97b |
hex | bb2f56fc9 |
50247069641 has 2 divisors, whose sum is σ = 50247069642. Its totient is φ = 50247069640.
The previous prime is 50247069637. The next prime is 50247069751. The reversal of 50247069641 is 14696074205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48754406416 + 1492663225 = 220804^2 + 38635^2 .
It is a cyclic number.
It is not a de Polignac number, because 50247069641 - 22 = 50247069637 is a prime.
It is a super-4 number, since 4×502470696414 (a number of 44 digits) contains 4444 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50247069592 and 50247069601.
It is not a weakly prime, because it can be changed into another prime (50247063641) 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, 25123534820 + 25123534821.
It is an arithmetic number, because the mean of its divisors is an integer number (25123534821).
Almost surely, 250247069641 is an apocalyptic number.
It is an amenable number.
50247069641 is a deficient number, since it is larger than the sum of its proper divisors (1).
50247069641 is an equidigital number, since it uses as much as digits as its factorization.
50247069641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 50247069641 in words is "fifty billion, two hundred forty-seven million, sixty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •