Base | Representation |
---|---|
bin | 101110101010100011… |
… | …010000110101111001 |
3 | 11210022222022002101020 |
4 | 232222203100311321 |
5 | 1310104114323001 |
6 | 35003545413053 |
7 | 3422450031504 |
oct | 565243206571 |
9 | 153288262336 |
10 | 50106011001 |
11 | 1a28259a752 |
12 | 986449a189 |
13 | 4956a09527 |
14 | 25d484813b |
15 | 1483d35736 |
hex | baa8d0d79 |
50106011001 has 4 divisors (see below), whose sum is σ = 66808014672. Its totient is φ = 33404007332.
The previous prime is 50106010951. The next prime is 50106011003. The reversal of 50106011001 is 10011060105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50106011001 - 210 = 50106009977 is a prime.
It is a super-2 number, since 2×501060110012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50106011003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8351001831 + ... + 8351001836.
It is an arithmetic number, because the mean of its divisors is an integer number (16702003668).
Almost surely, 250106011001 is an apocalyptic number.
It is an amenable number.
50106011001 is a deficient number, since it is larger than the sum of its proper divisors (16702003671).
50106011001 is a wasteful number, since it uses less digits than its factorization.
50106011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16702003670.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 50106011001 its reverse (10011060105), we get a palindrome (60117071106).
The spelling of 50106011001 in words is "fifty billion, one hundred six million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •