Base | Representation |
---|---|
bin | 101110111010001111… |
… | …111001000001011101 |
3 | 11211000022212000110222 |
4 | 232322033321001131 |
5 | 1311124024240112 |
6 | 35050034211125 |
7 | 3432125364563 |
oct | 567217710135 |
9 | 154008760428 |
10 | 50369368157 |
11 | 1a3a8216899 |
12 | 9918723aa5 |
13 | 4999447874 |
14 | 261b7dda33 |
15 | 149c007372 |
hex | bba3f905d |
50369368157 has 8 divisors (see below), whose sum is σ = 50703658656. Its totient is φ = 50035248432.
The previous prime is 50369368151. The next prime is 50369368171. The reversal of 50369368157 is 75186396305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50369368157 - 232 = 46074400861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50369368099 and 50369368108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50369368151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 579038 + ... + 660320.
It is an arithmetic number, because the mean of its divisors is an integer number (6337957332).
Almost surely, 250369368157 is an apocalyptic number.
It is an amenable number.
50369368157 is a deficient number, since it is larger than the sum of its proper divisors (334290499).
50369368157 is a wasteful number, since it uses less digits than its factorization.
50369368157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85387.
The product of its (nonzero) digits is 4082400, while the sum is 53.
The spelling of 50369368157 in words is "fifty billion, three hundred sixty-nine million, three hundred sixty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •