Base | Representation |
---|---|
bin | 1010000010001111101111… |
… | …1010101101111111000000 |
3 | 1110001210220200211120012120 |
4 | 2200203323322231333000 |
5 | 2421234010314140143 |
6 | 35244451332524240 |
7 | 2216105301466650 |
oct | 240437372557700 |
9 | 43053820746176 |
10 | 11033702490048 |
11 | 3574404453577 |
12 | 12a24a4780680 |
13 | 6206208a2264 |
14 | 2a206960c360 |
15 | 14202a38c383 |
hex | a08fbeadfc0 |
11033702490048 has 112 divisors (see below), whose sum is σ = 35326392079104. Its totient is φ = 2967046041600.
The previous prime is 11033702490043. The next prime is 11033702490071. The reversal of 11033702490048 is 84009420733011.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 11033702489991 and 11033702490009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11033702490043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 241435978 + ... + 241481673.
It is an arithmetic number, because the mean of its divisors is an integer number (315414214992).
Almost surely, 211033702490048 is an apocalyptic number.
It is an amenable number.
11033702490048 is an abundant number, since it is smaller than the sum of its proper divisors (24292689589056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033702490048 is a wasteful number, since it uses less digits than its factorization.
11033702490048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482917690 (or 482917680 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 42.
The spelling of 11033702490048 in words is "eleven trillion, thirty-three billion, seven hundred two million, four hundred ninety thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •