Base | Representation |
---|---|
bin | 10100100001000000… |
… | …11001000101010000 |
3 | 1001102121102200221012 |
4 | 22100200121011100 |
5 | 140024133020130 |
6 | 5020535350052 |
7 | 536642250056 |
oct | 122040310520 |
9 | 31377380835 |
10 | 11014345040 |
11 | 47423464a6 |
12 | 2174822328 |
13 | 1066baab3a |
14 | 766b661d6 |
15 | 446e74995 |
hex | 290819150 |
11014345040 has 40 divisors (see below), whose sum is σ = 25834996008. Its totient is φ = 4366745600.
The previous prime is 11014345039. The next prime is 11014345063. The reversal of 11014345040 is 4054341011.
It can be written as a sum of positive squares in 4 ways, for example, as 1602240784 + 9412104256 = 40028^2 + 97016^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-4 number, since 4×110143450404 (a number of 41 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11014344997 and 11014345015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 600161 + ... + 618240.
Almost surely, 211014345040 is an apocalyptic number.
11014345040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11014345040 is an abundant number, since it is smaller than the sum of its proper divisors (14820650968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014345040 is a wasteful number, since it uses less digits than its factorization.
11014345040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1218527 (or 1218521 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 11014345040 its reverse (4054341011), we get a palindrome (15068686051).
The spelling of 11014345040 in words is "eleven billion, fourteen million, three hundred forty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •