Base | Representation |
---|---|
bin | 10100100000100000… |
… | …11001000010100001 |
3 | 1001102022112121012010 |
4 | 22100100121002201 |
5 | 140022044304221 |
6 | 5020305423133 |
7 | 536561510214 |
oct | 122020310241 |
9 | 31368477163 |
10 | 11010150561 |
11 | 473aa41093 |
12 | 217333aaa9 |
13 | 106606c8b7 |
14 | 76639377b |
15 | 4468e6c76 |
hex | 2904190a1 |
11010150561 has 8 divisors (see below), whose sum is σ = 14680789920. Its totient is φ = 7339805792.
The previous prime is 11010150413. The next prime is 11010150563. The reversal of 11010150561 is 16505101011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010150561 - 29 = 11010150049 is a prime.
It is a super-2 number, since 2×110101505612 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11010150563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37546 + ... + 153068.
It is an arithmetic number, because the mean of its divisors is an integer number (1835098740).
Almost surely, 211010150561 is an apocalyptic number.
It is an amenable number.
11010150561 is a deficient number, since it is larger than the sum of its proper divisors (3670639359).
11010150561 is a wasteful number, since it uses less digits than its factorization.
11010150561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147295.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 11010150561 its reverse (16505101011), we get a palindrome (27515251572).
The spelling of 11010150561 in words is "eleven billion, ten million, one hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •