Base | Representation |
---|---|
bin | 101110101000001011… |
… | …000100111000000101 |
3 | 11210020012020012212100 |
4 | 232220023010320011 |
5 | 1310013411203401 |
6 | 35000002342313 |
7 | 3421453652031 |
oct | 565013047005 |
9 | 153205205770 |
10 | 50066116101 |
11 | 1a262021061 |
12 | 985305a999 |
13 | 494b67b791 |
14 | 25cd4211c1 |
15 | 14805a4b86 |
hex | ba82c4e05 |
50066116101 has 48 divisors (see below), whose sum is σ = 79974648000. Its totient is φ = 30046754304.
The previous prime is 50066116099. The next prime is 50066116123. The reversal of 50066116101 is 10161166005.
It is not a de Polignac number, because 50066116101 - 21 = 50066116099 is a prime.
It is a super-2 number, since 2×500661161012 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50066116141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 259050 + ... + 408948.
It is an arithmetic number, because the mean of its divisors is an integer number (1666138500).
Almost surely, 250066116101 is an apocalyptic number.
50066116101 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
50066116101 is a deficient number, since it is larger than the sum of its proper divisors (29908531899).
50066116101 is a wasteful number, since it uses less digits than its factorization.
50066116101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150018 (or 150015 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 50066116101 in words is "fifty billion, sixty-six million, one hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •