Base | Representation |
---|---|
bin | 10101011111101011… |
… | …10100010000000000 |
3 | 1002210020122112110221 |
4 | 22233311310100000 |
5 | 142113223230130 |
6 | 5145035232424 |
7 | 555654564223 |
oct | 125765642000 |
9 | 32706575427 |
10 | 11540055040 |
11 | 4992073178 |
12 | 22a08a8714 |
13 | 111ba95347 |
14 | 7b68d15ba |
15 | 4781ba87a |
hex | 2afd74400 |
11540055040 has 88 divisors (see below), whose sum is σ = 28575988992. Its totient is φ = 4467056640.
The previous prime is 11540055031. The next prime is 11540055041. The reversal of 11540055040 is 4055004511.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11540054996 and 11540055014.
It is not an unprimeable number, because it can be changed into a prime (11540055041) 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, 122367 + ... + 195073.
Almost surely, 211540055040 is an apocalyptic number.
11540055040 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 11540055040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14287994496).
11540055040 is an abundant number, since it is smaller than the sum of its proper divisors (17035933952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11540055040 is an equidigital number, since it uses as much as digits as its factorization.
11540055040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72763 (or 72745 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 25.
Adding to 11540055040 its reverse (4055004511), we get a palindrome (15595059551).
The spelling of 11540055040 in words is "eleven billion, five hundred forty million, fifty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •