Base | Representation |
---|---|
bin | 10100101001101110… |
… | …11010110011000010 |
3 | 1001121201001212021202 |
4 | 22110313122303002 |
5 | 140201344141432 |
6 | 5032111221202 |
7 | 541521053303 |
oct | 122467326302 |
9 | 31551055252 |
10 | 11087490242 |
11 | 477a665584 |
12 | 2195217802 |
13 | 10790ab11a |
14 | 7727667aa |
15 | 44d5c2462 |
hex | 294ddacc2 |
11087490242 has 16 divisors (see below), whose sum is σ = 17514794400. Its totient is φ = 5249499840.
The previous prime is 11087490233. The next prime is 11087490251. The reversal of 11087490242 is 24209478011.
It is a happy number.
11087490242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11087490233) and next prime (11087490251).
It is a super-3 number, since 3×110874902423 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 11087490196 and 11087490205.
It is an unprimeable number.
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, 14609 + ... + 149627.
It is an arithmetic number, because the mean of its divisors is an integer number (1094674650).
Almost surely, 211087490242 is an apocalyptic number.
11087490242 is a deficient number, since it is larger than the sum of its proper divisors (6427304158).
11087490242 is a wasteful number, since it uses less digits than its factorization.
11087490242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137201.
The product of its (nonzero) digits is 32256, while the sum is 38.
The spelling of 11087490242 in words is "eleven billion, eighty-seven million, four hundred ninety thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •