Base | Representation |
---|---|
bin | 10100100101010101… |
… | …01111000100101110 |
3 | 1001112010200012110112 |
4 | 22102222233010232 |
5 | 140112424022430 |
6 | 5024312540022 |
7 | 540562433516 |
oct | 122252570456 |
9 | 31463605415 |
10 | 11050610990 |
11 | 4760866661 |
12 | 21849b1612 |
13 | 1071567b93 |
14 | 76b8c6846 |
15 | 44a23a195 |
hex | 292aaf12e |
11050610990 has 16 divisors (see below), whose sum is σ = 20088043200. Its totient is φ = 4376479200.
The previous prime is 11050610911. The next prime is 11050610993. The reversal of 11050610990 is 9901605011.
It is a happy number.
11050610990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050610993) 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 7 ways as a sum of consecutive naturals, for example, 5469590 + ... + 5471609.
It is an arithmetic number, because the mean of its divisors is an integer number (1255502700).
Almost surely, 211050610990 is an apocalyptic number.
11050610990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11050610990 is a deficient number, since it is larger than the sum of its proper divisors (9037432210).
11050610990 is a wasteful number, since it uses less digits than its factorization.
11050610990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10941307.
The product of its (nonzero) digits is 2430, while the sum is 32.
The spelling of 11050610990 in words is "eleven billion, fifty million, six hundred ten thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •