Base | Representation |
---|---|
bin | 10000010100001110110… |
… | …000101100101111010000 |
3 | 10222012002201210101121121 |
4 | 100110032300230233100 |
5 | 121332241413031230 |
6 | 2215030550132024 |
7 | 144002140460662 |
oct | 20241660545720 |
9 | 3865081711547 |
10 | 1121234111440 |
11 | 3a2570475223 |
12 | 161377051014 |
13 | 8196905b861 |
14 | 3c3a763c532 |
15 | 1e274c4477a |
hex | 1050ec2cbd0 |
1121234111440 has 40 divisors (see below), whose sum is σ = 2622862402848. Its totient is φ = 445742144640.
The previous prime is 1121234111377. The next prime is 1121234111449. The reversal of 1121234111440 is 441114321211.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121234111449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42979066 + ... + 43005145.
Almost surely, 21121234111440 is an apocalyptic number.
1121234111440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121234111440 is an abundant number, since it is smaller than the sum of its proper divisors (1501628291408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121234111440 is a wasteful number, since it uses less digits than its factorization.
1121234111440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85984387 (or 85984381 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1121234111440 its reverse (441114321211), we get a palindrome (1562348432651).
The spelling of 1121234111440 in words is "one trillion, one hundred twenty-one billion, two hundred thirty-four million, one hundred eleven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •