Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …01100011000101010001001 |
3 | 20122011102000202200111011110 |
4 | 23200111312230120222021 |
5 | 23113021322232423001 |
6 | 255341440131520533 |
7 | 13441541656226256 |
oct | 1340256654305211 |
9 | 218142022614143 |
10 | 50601001061001 |
11 | 15139844a2a626 |
12 | 5812990a59149 |
13 | 223086689c571 |
14 | c6d15c7d442d |
15 | 5cb3ac81d3d6 |
hex | 2e0576b18a89 |
50601001061001 has 8 divisors (see below), whose sum is σ = 67549979548480. Its totient is φ = 33693011640432.
The previous prime is 50601001060943. The next prime is 50601001061029. The reversal of 50601001061001 is 10016010010605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50601001061001 - 211 = 50601001058953 is a prime.
It is a super-2 number, since 2×506010010610012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50601001021001) 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, 10247263846 + ... + 10247268783.
It is an arithmetic number, because the mean of its divisors is an integer number (8443747443560).
Almost surely, 250601001061001 is an apocalyptic number.
It is an amenable number.
50601001061001 is a deficient number, since it is larger than the sum of its proper divisors (16948978487479).
50601001061001 is a wasteful number, since it uses less digits than its factorization.
50601001061001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20494533455.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 50601001061001 its reverse (10016010010605), we get a palindrome (60617011071606).
The spelling of 50601001061001 in words is "fifty trillion, six hundred one billion, one million, sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •