Base | Representation |
---|---|
bin | 101110101010011111… |
… | …011010000001001001 |
3 | 11210022220101201120002 |
4 | 232222133122001021 |
5 | 1310103340000014 |
6 | 35003512012345 |
7 | 3422435321141 |
oct | 565237320111 |
9 | 153286351502 |
10 | 50105000009 |
11 | 1a281a6a119 |
12 | 98640910b5 |
13 | 49567442cc |
14 | 25d4663921 |
15 | 1483bd5dde |
hex | baa7da049 |
50105000009 has 8 divisors (see below), whose sum is σ = 52345957320. Its totient is φ = 47898256000.
The previous prime is 50104999981. The next prime is 50105000039. The reversal of 50105000009 is 90000050105.
50105000009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 39363750409 + 10741249600 = 198403^2 + 103640^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50105000009 - 228 = 49836564553 is a prime.
It is a super-2 number, since 2×501050000092 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50105000039) 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, 8550332 + ... + 8556189.
It is an arithmetic number, because the mean of its divisors is an integer number (6543244665).
Almost surely, 250105000009 is an apocalyptic number.
It is an amenable number.
50105000009 is a deficient number, since it is larger than the sum of its proper divisors (2240957311).
50105000009 is a wasteful number, since it uses less digits than its factorization.
50105000009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17106651.
The product of its (nonzero) digits is 225, while the sum is 20.
The spelling of 50105000009 in words is "fifty billion, one hundred five million, nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •