Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …01010101011111100010001 |
3 | 20121211020101110211222212202 |
4 | 23132330200022223330101 |
5 | 23104433330341343001 |
6 | 255225412044132545 |
7 | 13431604320453224 |
oct | 1336744012537421 |
9 | 217736343758782 |
10 | 50505060106001 |
11 | 15102091847076 |
12 | 57b8276537155 |
13 | 22247b6cb58c7 |
14 | c6865a8975bb |
15 | 5c8b44b1d96b |
hex | 2def202abf11 |
50505060106001 has 8 divisors (see below), whose sum is σ = 50615720515584. Its totient is φ = 50394440382880.
The previous prime is 50505060105967. The next prime is 50505060106027. The reversal of 50505060106001 is 10060106050505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50505060106001 is a prime.
It is a super-2 number, since 2×505050601060012 (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 (50505060106801) 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, 7685585 + ... + 12652206.
It is an arithmetic number, because the mean of its divisors is an integer number (6326965064448).
Almost surely, 250505060106001 is an apocalyptic number.
It is an amenable number.
50505060106001 is a deficient number, since it is larger than the sum of its proper divisors (110660409583).
50505060106001 is a wasteful number, since it uses less digits than its factorization.
50505060106001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20343231.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 50505060106001 its reverse (10060106050505), we get a palindrome (60565166156506).
The spelling of 50505060106001 in words is "fifty trillion, five hundred five billion, sixty million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •