Base | Representation |
---|---|
bin | 10101100111100011… |
… | …11100101110100010 |
3 | 1002221212000111210021 |
4 | 22303301330232202 |
5 | 142232133300200 |
6 | 5155400024054 |
7 | 560416435105 |
oct | 126361745642 |
9 | 32855014707 |
10 | 11606150050 |
11 | 4a16407350 |
12 | 22baa6202a |
13 | 112c697611 |
14 | 7c15b873c |
15 | 47ddc441a |
hex | 2b3c7cba2 |
11606150050 has 24 divisors (see below), whose sum is σ = 23549934672. Its totient is φ = 4220418000.
The previous prime is 11606150009. The next prime is 11606150063. The reversal of 11606150050 is 5005160611.
It is a hoax number, since the sum of its digits (25) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 11606149997 and 11606150024.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 10550496 + ... + 10551595.
It is an arithmetic number, because the mean of its divisors is an integer number (981247278).
Almost surely, 211606150050 is an apocalyptic number.
11606150050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11606150050 is an abundant number, since it is smaller than the sum of its proper divisors (11943784622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11606150050 is a wasteful number, since it uses less digits than its factorization.
11606150050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21102114 (or 21102109 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 11606150050 in words is "eleven billion, six hundred six million, one hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •