Base | Representation |
---|---|
bin | 10101010011111000… |
… | …11111000100100000 |
3 | 1002112100112010112221 |
4 | 22221330133010200 |
5 | 141412412440000 |
6 | 5131143200424 |
7 | 553344041203 |
oct | 125174370440 |
9 | 32470463487 |
10 | 11441140000 |
11 | 4941252904 |
12 | 2273746114 |
13 | 1104441634 |
14 | 7a770393a |
15 | 46e67c61a |
hex | 2a9f1f120 |
11441140000 has 120 divisors (see below), whose sum is σ = 28909517868. Its totient is φ = 4452480000.
The previous prime is 11441139991. The next prime is 11441140013. The reversal of 11441140000 is 4114411.
It can be written as a sum of positive squares in 10 ways, for example, as 514200976 + 10926939024 = 22676^2 + 104532^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 732270 + ... + 747730.
Almost surely, 211441140000 is an apocalyptic number.
11441140000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11441140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14454758934).
11441140000 is an abundant number, since it is smaller than the sum of its proper divisors (17468377868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11441140000 is an equidigital number, since it uses as much as digits as its factorization.
11441140000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15528 (or 15505 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11441140000 its reverse (4114411), we get a palindrome (11445254411).
The spelling of 11441140000 in words is "eleven billion, four hundred forty-one million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •