Base | Representation |
---|---|
bin | 10100100101011110… |
… | …01010001010110110 |
3 | 1001112012212010002012 |
4 | 22102233022022312 |
5 | 140113223124200 |
6 | 5024353444222 |
7 | 540605333252 |
oct | 122257121266 |
9 | 31465763065 |
10 | 11051770550 |
11 | 4761488877 |
12 | 2185270672 |
13 | 1071882902 |
14 | 76bb09262 |
15 | 44a3b8a35 |
hex | 292bca2b6 |
11051770550 has 24 divisors (see below), whose sum is σ = 21765488616. Its totient is φ = 4160666240.
The previous prime is 11051770519. The next prime is 11051770553. The reversal of 11051770550 is 5507715011.
It is a happy number.
11051770550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051770553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6500192 + ... + 6501891.
It is an arithmetic number, because the mean of its divisors is an integer number (906895359).
Almost surely, 211051770550 is an apocalyptic number.
11051770550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11051770550 is a deficient number, since it is larger than the sum of its proper divisors (10713718066).
11051770550 is a wasteful number, since it uses less digits than its factorization.
11051770550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13002112 (or 13002107 counting only the distinct ones).
The product of its (nonzero) digits is 6125, while the sum is 32.
The spelling of 11051770550 in words is "eleven billion, fifty-one million, seven hundred seventy thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •