Base | Representation |
---|---|
bin | 10100100001000011… |
… | …01111010100000000 |
3 | 1001102122002122102200 |
4 | 22100201233110000 |
5 | 140024230320430 |
6 | 5020551113200 |
7 | 536645250600 |
oct | 122041572400 |
9 | 31378078380 |
10 | 11014698240 |
11 | 47425678a7 |
12 | 2174972800 |
13 | 1066ca2830 |
14 | 766c18c00 |
15 | 446ee4460 |
hex | 29086f500 |
11014698240 has 1296 divisors, whose sum is σ = 50890694400. Its totient is φ = 2173796352.
The previous prime is 11014698199. The next prime is 11014698263. The reversal of 11014698240 is 4289641011.
11014698240 is a `hidden beast` number, since 110 + 1 + 469 + 82 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11014698195 and 11014698204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 139426521 + ... + 139426599.
Almost surely, 211014698240 is an apocalyptic number.
11014698240 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 11014698240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25445347200).
11014698240 is an abundant number, since it is smaller than the sum of its proper divisors (39875996160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014698240 is a wasteful number, since it uses less digits than its factorization.
11014698240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152 (or 128 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The spelling of 11014698240 in words is "eleven billion, fourteen million, six hundred ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •