Base | Representation |
---|---|
bin | 10110110101000011011111… |
… | …11011011111000000100101 |
3 | 20120202012201202110010002001 |
4 | 23122201233323133000211 |
5 | 23040000040114321013 |
6 | 254434121430245301 |
7 | 13400635604063446 |
oct | 1332415773370045 |
9 | 216665652403061 |
10 | 50201455620133 |
11 | 14aa5354a48234 |
12 | 5769465ab6831 |
13 | 2201c9149612c |
14 | c57a98b592cd |
15 | 5c0cc5cb3ddd |
hex | 2da86fedf025 |
50201455620133 has 16 divisors (see below), whose sum is σ = 51286400919936. Its totient is φ = 49129502653440.
The previous prime is 50201455620097. The next prime is 50201455620143. The reversal of 50201455620133 is 33102655410205.
It is a cyclic number.
It is not a de Polignac number, because 50201455620133 - 241 = 48002432364581 is a prime.
It is a super-2 number, since 2×502014556201332 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50201455620092 and 50201455620101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50201455620143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3145473 + ... + 10502233.
It is an arithmetic number, because the mean of its divisors is an integer number (3205400057496).
Almost surely, 250201455620133 is an apocalyptic number.
It is an amenable number.
50201455620133 is a deficient number, since it is larger than the sum of its proper divisors (1084945299803).
50201455620133 is a wasteful number, since it uses less digits than its factorization.
50201455620133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7357644.
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 50201455620133 in words is "fifty trillion, two hundred one billion, four hundred fifty-five million, six hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •