Base | Representation |
---|---|
bin | 10110110001000000011111… |
… | …01100110010001001010111 |
3 | 20120020220210212220111000001 |
4 | 23120200033230302021113 |
5 | 23030210244430401101 |
6 | 254250203341032131 |
7 | 13354613665364605 |
oct | 1330401754621127 |
9 | 216226725814001 |
10 | 50062402200151 |
11 | 14a51388a10730 |
12 | 5746519255647 |
13 | 21c1b30a59373 |
14 | c51067130875 |
15 | 5bc388220901 |
hex | 2d880fb32257 |
50062402200151 has 8 divisors (see below), whose sum is σ = 54613582715664. Its totient is φ = 45511230525120.
The previous prime is 50062402200089. The next prime is 50062402200203. The reversal of 50062402200151 is 15100220426005.
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 50062402200151 - 27 = 50062402200023 is a prime.
It is a super-2 number, since 2×500624022001512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50062402209151) 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, 16565211 + ... + 19352803.
It is an arithmetic number, because the mean of its divisors is an integer number (6826697839458).
Almost surely, 250062402200151 is an apocalyptic number.
50062402200151 is a deficient number, since it is larger than the sum of its proper divisors (4551180515513).
50062402200151 is a wasteful number, since it uses less digits than its factorization.
50062402200151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4420241.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 50062402200151 its reverse (15100220426005), we get a palindrome (65162622626156).
The spelling of 50062402200151 in words is "fifty trillion, sixty-two billion, four hundred two million, two hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •