Base | Representation |
---|---|
bin | 1110100011010101001… |
… | …11111100000111101101 |
3 | 1202210121012201211202201 |
4 | 13101222213330013231 |
5 | 31143002243423401 |
6 | 1021411003421501 |
7 | 51060406615630 |
oct | 7215247740755 |
9 | 1683535654681 |
10 | 500005061101 |
11 | 183061904a27 |
12 | 80aa2824891 |
13 | 381c5200600 |
14 | 1a2b3b7dc17 |
15 | d0162d2b01 |
hex | 746a9fc1ed |
500005061101 has 24 divisors (see below), whose sum is σ = 619687096704. Its totient is φ = 395023412160.
The previous prime is 500005061053. The next prime is 500005061189. The reversal of 500005061101 is 101160500005.
It is not a de Polignac number, because 500005061101 - 235 = 465645322733 is a prime.
It is a super-2 number, since 2×5000050611012 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500005061401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 488736 + ... + 1113046.
It is an arithmetic number, because the mean of its divisors is an integer number (25820295696).
Almost surely, 2500005061101 is an apocalyptic number.
It is an amenable number.
500005061101 is a deficient number, since it is larger than the sum of its proper divisors (119682035603).
500005061101 is a wasteful number, since it uses less digits than its factorization.
500005061101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625021 (or 625008 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 500005061101 its reverse (101160500005), we get a palindrome (601165561106).
The spelling of 500005061101 in words is "five hundred billion, five million, sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •