Base | Representation |
---|---|
bin | 1010010011100000110001… |
… | …0110101110100000110000 |
3 | 1111010011120020201201022202 |
4 | 2210320030112232200300 |
5 | 2441114004214323440 |
6 | 40033025431322332 |
7 | 2246406110353562 |
oct | 244701426564060 |
9 | 44104506651282 |
10 | 11330331011120 |
11 | 3679191524850 |
12 | 132ba88b203a8 |
13 | 6425a4082b04 |
14 | 2b2568a89332 |
15 | 149adba79615 |
hex | a4e0c5ae830 |
11330331011120 has 80 divisors (see below), whose sum is σ = 29987310903552. Its totient is φ = 3940984692480.
The previous prime is 11330331011101. The next prime is 11330331011221. The reversal of 11330331011120 is 2111013303311.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 11330331011092 and 11330331011101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 279879242 + ... + 279919721.
Almost surely, 211330331011120 is an apocalyptic number.
11330331011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11330331011120 is an abundant number, since it is smaller than the sum of its proper divisors (18656979892432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11330331011120 is a wasteful number, since it uses less digits than its factorization.
11330331011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559799010 (or 559799004 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 11330331011120 its reverse (2111013303311), we get a palindrome (13441344314431).
The spelling of 11330331011120 in words is "eleven trillion, three hundred thirty billion, three hundred thirty-one million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •